2010 10th International Conference on Application of Concurrency to System Design最新文献_第2页

Robustness of Sequential Circuits 顺序电路的鲁棒性

2010 10th International Conference on Application of Concurrency to System Design Pub Date : 2010-06-21 DOI: 10.1109/ACSD.2010.26

L. Doyen, T. Henzinger, Axel Legay, D. Ničković

{"title":"Robustness of Sequential Circuits","authors":"L. Doyen, T. Henzinger, Axel Legay, D. Ničković","doi":"10.1109/ACSD.2010.26","DOIUrl":"https://doi.org/10.1109/ACSD.2010.26","url":null,"abstract":"Digital components play a central role in the design of complex embedded systems. These components are interconnected with other, possibly analog, devices and the physical environment. This environment cannot be entirely captured and can provide inaccurate input data to the component. It is thus important for digital components to have a robust behavior, i.e. the presence of a small change in the input sequences should not result in a drastic change in the output sequences. In this paper, we study a notion of robustness for sequential circuits. However, since sequential circuits may have parts that are naturally discontinuous (e.g., digital controllers with switching behavior), we need a flexible framework that accommodates this fact and leaves discontinuous parts of the circuit out from the robustness analysis. As a consequence, we consider sequential circuits that have their input variables partitioned into two disjoint sets: control and disturbance variables. Our contributions are (1) a definition of robustness for sequential circuits as a form of continuity with respect to disturbance variables, (2) the characterization of the exact class of sequential circuits that are robust according to our definition, (3) an algorithm to decide whether a sequential circuit is robust or not.","PeriodicalId":169191,"journal":{"name":"2010 10th International Conference on Application of Concurrency to System Design","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127434463","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}

引用次数: 37

Probabilistic Contracts: A Compositional Reasoning Methodology for the Design of Stochastic Systems 概率契约:随机系统设计的组合推理方法

2010 10th International Conference on Application of Concurrency to System Design Pub Date : 2010-06-21 DOI: 10.1109/ACSD.2010.13

Benoît Delahaye, B. Caillaud, Axel Legay

引用次数: 33

Partial Order Reduction for Branching Security Protocols 分支安全协议的偏序约简

2010 10th International Conference on Application of Concurrency to System Design Pub Date : 2010-06-21 DOI: 10.1109/ACSD.2010.19

W. Fokkink, M. Dashti, Anton Wijs

引用次数: 13

polyDD: Towards a Framework Generalizing Decision Diagrams polyDD:迈向一般化决策图的框架

2010 10th International Conference on Application of Concurrency to System Design Pub Date : 2010-06-21 DOI: 10.1109/ACSD.2010.17

Alban Linard, E. Paviot-Adet, F. Kordon, Didier Buchs, Samuel Charron

引用次数: 9

Modular Interpretation of Heterogeneous Modeling Diagrams into Synchronous Equations Using Static Single Assignment 用静态单一赋值将异构建模图模块化解释为同步方程

2010 10th International Conference on Application of Concurrency to System Design Pub Date : 2010-06-21 DOI: 10.1109/ACSD.2010.14

J. Talpin, J. Ouy, T. Gautier, L. Besnard, A. Cortier

{"title":"Modular Interpretation of Heterogeneous Modeling Diagrams into Synchronous Equations Using Static Single Assignment","authors":"J. Talpin, J. Ouy, T. Gautier, L. Besnard, A. Cortier","doi":"10.1109/ACSD.2010.14","DOIUrl":"https://doi.org/10.1109/ACSD.2010.14","url":null,"abstract":"The ANR project SPACIFY develops a domain-specific programming environment, Synoptic, to engineer embedded software for space applications. Synoptic is an Eclipse-based modeling environment which supports all aspects of aerospace software design. As such, it is a domain-specific environment consisting of heterogeneous modeling and programming principles defined in collaboration with the industrial partners and end users of the project : imperative synchronous programs, data-flow diagrams, mode automata, blocks, components, scheduling, mapping and timing. This article focuses on the essence and distinctive features of its behavioral or programming aspects : actions, flows and automata, for which we use the code generation infrastructure of the synchronous modeling environment SME. It introduces an efficient method for transforming a hierarchy of blocks consisting of actions (sequential Esterel-like programs), data-flow diagrams (to connect and time modules) and mode automata (to schedule or mode blocks) into a set of synchronous equations. This transformation significantly reduces the needed control states and block synchronizations. It consists of an inductive static-single assignment transformation algorithm across a hierarchy of blocks that produces synchronous equations. The impact of this new transformation technique is twofold. With regards to code generation objectives, it reduces the needed resynchronization of each block in the system with respects to its parents, potentially gaining substantial performance from way less synchronizations. With regards to verification requirements, it also reduces the number of states across a hierarchy of automata and hence maximizes model checking performances.","PeriodicalId":169191,"journal":{"name":"2010 10th International Conference on Application of Concurrency to System Design","volume":"8 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121903716","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}

引用次数: 5

STG Decomposition: Internal Communication for SI Implementability STG分解:SI可实现性的内部沟通

2010 10th International Conference on Application of Concurrency to System Design Pub Date : 2010-06-21 DOI: 10.1109/ACSD.2010.15

Dominic Wist, Mark Schäfer, W. Vogler, Ralf Wollowski

引用次数: 8

Wagging Logic: Implicit Parallelism Extraction Using Asynchronous Methodologies 摇摆逻辑:使用异步方法的隐式并行抽取

2010 10th International Conference on Application of Concurrency to System Design Pub Date : 2010-06-21 DOI: 10.1109/ACSD.2010.11

C. Brej

引用次数: 7

From POOSL to UPPAAL: Transformation and Quantitative Analysis 从pool到UPPAAL:转换与定量分析

2010 10th International Conference on Application of Concurrency to System Design Pub Date : 2010-06-21 DOI: 10.1109/ACSD.2010.21

Jiansheng Xing, B. Theelen, R. Langerak, J. Pol, J. Tretmans, J. Voeten

{"title":"From POOSL to UPPAAL: Transformation and Quantitative Analysis","authors":"Jiansheng Xing, B. Theelen, R. Langerak, J. Pol, J. Tretmans, J. Voeten","doi":"10.1109/ACSD.2010.21","DOIUrl":"https://doi.org/10.1109/ACSD.2010.21","url":null,"abstract":"POOSL (Parallel Object-Oriented Specification Language) is a powerful general purpose system-level modeling language. In research on design space exploration of motion control systems, POOSL has been used to construct models for performance analysis. The considered motion control algorithms are characterized by periodic execution. They are executed by multiple processors, which are interconnected by Rapid Input/Output (RapidIO) packet switches. Packet latencies as worst-case latencies and average-case latencies are essential performance criteria for motion control systems. However, POOSL analysis merely allows for estimation results for these latency metrics since it is primarily based on simulation. Because motion control systems are time-critical and safety-critical, worst-case latencies of packets are strict timing constraints. Therefore exact worst-case latencies are to be determined. Motivated by this requirement we propose to use model checking techniques. In this paper we illustrate how a POOSL model of a (simplified) motion control system can be transformed into an UPPAAL model and we verify its functional behavior and worst-case latencies. Moreover, we show that analysis of average-case latencies can also be accomplished with assistance of the model checking tool UPPAAL.","PeriodicalId":169191,"journal":{"name":"2010 10th International Conference on Application of Concurrency to System Design","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128469367","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}

引用次数: 12

Cut-Offs with Network Invariants 网络不变量的截止

2010 10th International Conference on Application of Concurrency to System Design Pub Date : 2010-06-21 DOI: 10.1109/ACSD.2010.16

Antti Siirtola

引用次数: 8

Aggregation Ordering for Massively Compositional Models 大规模组合模型的聚合排序

2010 10th International Conference on Application of Concurrency to System Design Pub Date : 2010-06-21 DOI: 10.1109/ACSD.2010.28

P. Crouzen, H. Hermanns

{"title":"Aggregation Ordering for Massively Compositional Models","authors":"P. Crouzen, H. Hermanns","doi":"10.1109/ACSD.2010.28","DOIUrl":"https://doi.org/10.1109/ACSD.2010.28","url":null,"abstract":"Compositional modeling is a powerful way of expressing the behavior of a complex system through the interaction of its components. Analysis of compositional models is difficult because of the state space explosion. One solution is compositional aggregation where composition and aggregation steps are intertwined. This approach has proven particularly useful in the area of compositional performance and dependability modelling. However, one open question remains: in which order should the models be composed, a question that is especially important for massively compositional models derived automatically from higher level descriptions. Finding the optimal composition ordering is generally infeasible, so heuristics are necessary to find good orderings. In this paper we present a comparative study of compositional aggregation algorithms which harvest and refine heuristics originating from Tai and Koppol. The heuristics take into account the interaction between components, the size of the component models and uses early elimination of bad composition orders to dramatically decrease computation time. We present an implementation of the algorithms and study its effectiveness by applying it to case studies from different application areas.","PeriodicalId":169191,"journal":{"name":"2010 10th International Conference on Application of Concurrency to System Design","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132067139","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}

引用次数: 15