2015 15th International Conference on Application of Concurrency to System Design最新文献

Building a Symbolic Model Checker from Formal Language Description 从形式语言描述构建符号模型检查器

2015 15th International Conference on Application of Concurrency to System Design Pub Date : 2015-06-21 DOI: 10.1109/ACSD.2015.10

Edmundo López Bóbeda, Maximilien Colange, Didier Buchs

引用次数: 4

A Framework for Composition, Verification and Real-Time Performance of Multimedia Interactive Scenarios 多媒体交互场景的组成、验证和实时性能框架

2015 15th International Conference on Application of Concurrency to System Design Pub Date : 2015-06-21 DOI: 10.1109/ACSD.2015.8

Jaime Arias, M. Desainte-Catherine, C. Rueda

{"title":"A Framework for Composition, Verification and Real-Time Performance of Multimedia Interactive Scenarios","authors":"Jaime Arias, M. Desainte-Catherine, C. Rueda","doi":"10.1109/ACSD.2015.8","DOIUrl":"https://doi.org/10.1109/ACSD.2015.8","url":null,"abstract":"Interactive Scores (IS) is a formalism for composing and performing interactive multimedia scenarios. In IS, the composer defines temporal relations (TRs) between temporal objects (TOs) in order to specify the temporal organization of the scenario. During execution, the performer may trigger interaction points to modify the star/stop times of TOs, while the system guarantees that all the TRs are satisfied. IS is implemented in the tool I-SCORE and its semantics is formally defined as a Hierarchical Time Stream Petri Net (HTSPN). However, this model is not able to represent branching behaviors that are necessary to properly deal with applications such as video games and museum installations. Moreover, HTSPN does not provide tools for the automatic verification of critical properties of scenarios. In this work we define a semantics for IS based on Timed Automata (TA) and we show that such model yields to a complete framework to compose, verify and execute interactive scenarios. More precisely, we show that: 1) our model is able to deal with conditional statements in IS; 2) efficient verification techniques can be now used to reason about the written scenarios; and 3) our model allows for a directly implementation on a reconfigurable device, thus guaranteeing a real-time performance.","PeriodicalId":162527,"journal":{"name":"2015 15th International Conference on Application of Concurrency to System Design","volume":"155 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128666276","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

A Heuristic Algorithm for Deriving Compact Models of Processor Instruction Sets 一种导出处理器指令集紧凑模型的启发式算法

2015 15th International Conference on Application of Concurrency to System Design Pub Date : 2015-06-21 DOI: 10.1109/ACSD.2015.17

Alessandro de Gennaro, P. Stankaitis, A. Mokhov

引用次数: 9

Order Graphs and Cross-Layer Parametric Significance-Driven Modelling 序图和跨层参数意义驱动建模

2015 15th International Conference on Application of Concurrency to System Design Pub Date : 2015-06-21 DOI: 10.1109/ACSD.2015.16

A. Rafiev, Fei Xia, A. Iliasov, Rem Gensh, Ali Aalsaud, A. Romanovsky, A. Yakovlev

{"title":"Order Graphs and Cross-Layer Parametric Significance-Driven Modelling","authors":"A. Rafiev, Fei Xia, A. Iliasov, Rem Gensh, Ali Aalsaud, A. Romanovsky, A. Yakovlev","doi":"10.1109/ACSD.2015.16","DOIUrl":"https://doi.org/10.1109/ACSD.2015.16","url":null,"abstract":"Traditional hierarchical modelling methods tend to have layers of abstraction corresponding to naturally existing layers of concern in multi-level systems. Although logically and functionally intuitive, this is not always optimal for analysis and design. For instance, parts of a system in the same logical layer may not contribute to the same degree on some metric, e.g. system power consumption. When focusing on a specific parameter or set of parameters, to moderate the analysis, design and runtime effort, less significant parts of the system should be modelled at higher levels of abstraction and more significant ones with more detail. This parametric significance-driven modelling approach focuses more on optimal parametric fidelity than on logical intuition. Using system power consumption as an example parameter, this paper presents Order Graphs (OGs), which have a clear hierarchical structure, and provide straightforward vertical zooming across multiple layers (orders) of model abstraction, resulting in the discovery of power-proportional cuts that run through different orders to be analysed together in a flat manner. Stochastic Activity Networks (SANs), a good flat modelling method, is suggested as an example of studying techniques for cuts discovered with OGs. A series of experiments on an Odroid development system consisting of an ARM big.LITTLE multi-core structure provides initial validation for the approach.","PeriodicalId":162527,"journal":{"name":"2015 15th International Conference on Application of Concurrency to System Design","volume":"19 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120850027","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 8

When Do We (Not) Need Complex Assume-Guarantee Rules? 什么时候我们需要(不需要)复杂的假设-担保规则?

2015 15th International Conference on Application of Concurrency to System Design Pub Date : 2015-06-21 DOI: 10.1145/3012280

Antti Siirtola, S. Tripakis, Keijo Heljanko

{"title":"When Do We (Not) Need Complex Assume-Guarantee Rules?","authors":"Antti Siirtola, S. Tripakis, Keijo Heljanko","doi":"10.1145/3012280","DOIUrl":"https://doi.org/10.1145/3012280","url":null,"abstract":"Assume-guarantee (AG) reasoning is a compositional verification method where a verification task involving many processes is broken into multiple verification tasks involving fewer and/or simpler processes. Unfortunately, AG verification rules, and especially circular rules are often complex and hence hard to reason about. This raises the question whether complex rules are really necessary, especially in view of formalisms that already enable compositional reasoning via simple rules based on precongruence. This paper investigates this question for two formalisms: (1) labelled transition systems (LTS) with parallel composition and weak simulation, and (2) interface automata (IA) with composition and alternating simulation ><;OI. In (1), not all AG rules are sound and the precongruence rule cannot replace all sound ones, but we can provide a generic and sound AG rule that complements the precongruence rule. We show that in (2) all AG rules are sound and can be replaced by a simple rule where all premisses are of the form Pi><;OI Qt. Moreover, we show that proofs in the LTS AG rule can be converted into proofs in the simple IA rule. This suggests that circular reasoning is a built-in feature of the IA formalism, and provided system components can be modelled as IA, complex assume-guarantee rules are not needed.","PeriodicalId":162527,"journal":{"name":"2015 15th International Conference on Application of Concurrency to System Design","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121518370","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Unfolding Based Minimal Test Suites for Testing Multithreaded Programs 用于测试多线程程序的基于展开的最小测试套件

2015 15th International Conference on Application of Concurrency to System Design Pub Date : 2015-06-21 DOI: 10.1109/ACSD.2015.12

Hernán Ponce de León, Olli Saarikivi, Kari Kähkönen, Keijo Heljanko, J. Esparza

引用次数: 8

Testing Preorders for dMTS: Deadlock- and the New Deadlock/Divergence-Testing dMTS测试预购:死锁和新的死锁/发散测试

2015 15th International Conference on Application of Concurrency to System Design Pub Date : 2015-06-21 DOI: 10.1109/ACSD.2015.21

Ferenc Bujtor, Lev Sorokin, W. Vogler

{"title":"Testing Preorders for dMTS: Deadlock- and the New Deadlock/Divergence-Testing","authors":"Ferenc Bujtor, Lev Sorokin, W. Vogler","doi":"10.1109/ACSD.2015.21","DOIUrl":"https://doi.org/10.1109/ACSD.2015.21","url":null,"abstract":"Testing preorders on component specifications ensure that replacing a specification by a refined one does not introduce unwanted behaviour in an overall system. Considering deadlocks as unwanted, the preorder can be characterized by a failure semantics on labelled transition systems (LTS). In previous work, we have generalized this to modal transition systems (MTS) with a new, MTS-specific idea. In the present paper, we generalize this idea further to dMTS, a subclass of disjunctive MTS. On the one hand, the testing preorder can be characterized by the same failure semantics, and dMTS have no additional expressivity in our setting. On the other hand, the technical treatment is significantly harder and, surprisingly, the preorder is not a precongruence for parallel composition. Furthermore, we regard deadlocks and divergence as unwanted and characterize the testing preorder with an unusual failure-divergence semantics. This preorder is already on LTS strictly coarser - and hence better - than the traditional failuredivergence preorder. It is a precongruence on dMTS and much easier to handle than the deadlock-based preorder.","PeriodicalId":162527,"journal":{"name":"2015 15th International Conference on Application of Concurrency to System Design","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131681775","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7

Task-FIFO Co-scheduling of Streaming Applications on MPSoCs with Predictable Memory Hierarchy 具有可预测内存层次结构的mpsoc上流应用的任务- fifo协同调度

2015 15th International Conference on Application of Concurrency to System Design Pub Date : 2015-06-21 DOI: 10.1145/3038484

Qi Tang, T. Basten, M. Geilen, S. Stuijk, Jibo Wei

引用次数: 7

Incremental Inductive Verification of Parameterized Timed Systems 参数化时间系统的增量归纳验证

2015 15th International Conference on Application of Concurrency to System Design Pub Date : 2015-06-21 DOI: 10.1145/2984640

Tobias Isenberg

引用次数: 3

Preserving Partial Order Runs in Parametric Time Petri Nets 保持参数时间Petri网的偏序运行

2015 15th International Conference on Application of Concurrency to System Design Pub Date : 2015-06-21 DOI: 10.1145/3012283

É. André, T. Chatain, César Rodríguez

引用次数: 2