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

Towards Optimal Supervisory Control of Discrete-Time Stochastic Discrete-Event Processes with Data 具有数据的离散时间随机离散事件过程的最优监督控制

2013 13th International Conference on Application of Concurrency to System Design Pub Date : 2013-07-08 DOI: 10.1109/ACSD.2013.29

J. Markovski

{"title":"Towards Optimal Supervisory Control of Discrete-Time Stochastic Discrete-Event Processes with Data","authors":"J. Markovski","doi":"10.1109/ACSD.2013.29","DOIUrl":"https://doi.org/10.1109/ACSD.2013.29","url":null,"abstract":"We propose a model-based systems engineering framework for supervisory control and probabilistic model checking of discrete-time stochastic discrete-event systems. Supervisory control theory deals with synthesis of models of supervisory controllers that ensure safe and nonblocking behavior, based on models of the uncontrolled system and the control requirements. However, guaranteeing only safety and nonblocking properties of the supervised system is not sufficient, and often performance measures must be taken into account. Unfortunately, treating optimality in the synthesis procedure is a costly undertaking. Therefore, we propose to decouple the synthesis of the supervisor that caters for functional aspects of the system from the performance evaluation that considers the quantitative aspects. We provide an appropriate abstraction of the stochastic behavior, which enables us to employ standard supervisory controller synthesis tools. The synthesized supervisor is, thereafter, coupled with the stochastic model of the unsupervised system, and abstracted to a discretetime Markov process, which is fed to a probabilistic model checker to validate the performance requirements.","PeriodicalId":166715,"journal":{"name":"2013 13th International Conference on Application of Concurrency to System Design","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130346353","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}

引用次数: 2

A New Multi-threaded Code Synthesis Methodology and Tool for Correct-by-Construction Synthesis from Polychronous Specifications 一种新的多线程代码综合方法和基于多同步规范的按结构正确综合工具

2013 13th International Conference on Application of Concurrency to System Design Pub Date : 2013-07-08 DOI: 10.1109/ACSD.2013.6

M. Nanjundappa, M. Kracht, J. Ouy, S. Shukla

{"title":"A New Multi-threaded Code Synthesis Methodology and Tool for Correct-by-Construction Synthesis from Polychronous Specifications","authors":"M. Nanjundappa, M. Kracht, J. Ouy, S. Shukla","doi":"10.1109/ACSD.2013.6","DOIUrl":"https://doi.org/10.1109/ACSD.2013.6","url":null,"abstract":"Embedded software systems respond to multiple events coming from various sources - some temporally regular (ex: periodic sampling of continuous time signals) and some intermittent (ex: interrupts, exception events etc.). Timely response to such events while executing complex computation, might require multi-threaded implementation. For example, overlapping I/O of various types of events, and computation on such events may be delegated to different threads. However, manual programming of multi-threaded programs is error-prone, and proving correctness is computationally expensive. In order to guarantee safety of such implementations, we believe that a correct-by-construction synthesis of multi-threaded software from formal specification is required. It is also imperative that the multiple threads are capable of making progress asynchronous to each other, only synchronizing when shared data is involved or information requires to be passed from one thread to other. Especially on a multi-core platform, lesser the synchronization between threads, better will be the performance. Also, the ability of the threads to make asynchronous progress, rather than barrier synchronize too often, would allow better real-time schedulability. In this work, we describe our technique for multi-threaded code synthesis from a variant of the polychronous programming language SIGNAL, namely MRICDF. Through a series of experimental benchmarks we show the efficacy of our synthesis technique. Our tool EmCodeSyn which was built originally for sequential code synthesis from MRICDF models has been now extended with multi-threaded code synthesis capability. Our technique first checks the concurrent implementability of the given MRICDF model. For implementable models, we further compute the execution schedule and generate multi-threaded code with appropriate synchronization constructs so that the behavior of the implementation is latency equivalent to that of the original MRICDF model.","PeriodicalId":166715,"journal":{"name":"2013 13th International Conference on Application of Concurrency to System Design","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115111225","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}

引用次数: 9

Checking Partial-Order Properties of Vector Addition Systems with States 带状态向量加法系统的偏序性质检验

2013 13th International Conference on Application of Concurrency to System Design Pub Date : 2013-07-08 DOI: 10.1109/ACSD.2013.13

Florent Avellaneda, R. Morin

{"title":"Checking Partial-Order Properties of Vector Addition Systems with States","authors":"Florent Avellaneda, R. Morin","doi":"10.1109/ACSD.2013.13","DOIUrl":"https://doi.org/10.1109/ACSD.2013.13","url":null,"abstract":"Message Sequence Graphs (MSGs) form a popular model often used for the documentation of telecommunication protocols. They consist of typical scenarios of message exchanges depicted as partial-orders of events that lead from one control state to another. On the other hand Petri nets are a well-known formalism for distributed or parallel systems based on the notion of token game. Both approaches profit by a visual presentation and are the subject of numerous formal verification techniques and tools. In this paper we investigate a formalism which provides MSGs with the notion of token game and extends Petri nets with both control states and partial orders. Providing Petri nets with control states corresponds precisely to the model of Vector Addition Systems with States (VASSs). Thus we need to define first a partial-order semantics for VASSs which adopts the basic features of communication scenarios. To do so we extend simply the process semantics of Petri nets. We obtain a formal model that enjoys several interesting properties in terms of expressiveness and concision. The addition of control states to Petri nets under the partial-order semantics leads to undecidable problems. Similarly to MSGs, one cannot decide in particular whether two given VASSs describe the same process language. However we show that basic problems about the set of markings reached along the processes of a VASS, such as boundedness, covering and reachability, can be reduced to the analogous problems for Petri nets. This relies on a new technique that simulates all prefixes of all processes. In this way Petri net tools can be used to verify the properties of a VASS under the process semantics. We present also a technique to check effectively any MSO property of these partial orders, provided that the given system is bounded. This enables us to tackle more verification problems and subsumes known results for the model checking of MSGs. All algorithms presented in this paper have been implemented in a prototype tool available online.","PeriodicalId":166715,"journal":{"name":"2013 13th International Conference on Application of Concurrency to System Design","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116050608","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

Polynomial Sufficient Conditions of Well-Behavedness for Weighted Join-Free and Choice-Free Systems 加权无连接和无选择系统的多项式性充分条件

2013 13th International Conference on Application of Concurrency to System Design Pub Date : 2013-07-08 DOI: 10.1109/ACSD.2013.12

J. Delosme, Thomas Hujsa, Alix Munier Kordon

{"title":"Polynomial Sufficient Conditions of Well-Behavedness for Weighted Join-Free and Choice-Free Systems","authors":"J. Delosme, Thomas Hujsa, Alix Munier Kordon","doi":"10.1109/ACSD.2013.12","DOIUrl":"https://doi.org/10.1109/ACSD.2013.12","url":null,"abstract":"Join-Free Petri nets, whose transitions have at most one input place, model systems without synchronizations while Choice-Free Petri nets, whose places have at most one output transition, model systems without conflicts. These classes respectively encompass the state machines (or S-systems) and the marked graphs (or T-systems).Whereas a structurally bounded and structurally live Petri net graph is said to be \"well-formed\", a bounded and live Petri net is said to be \"well-behaved\". Necessary and sufficient conditions for the well-formedness of Join-Free and Choice-Free nets have been known for some time, yet the behavioral properties of these classes are still not well understood. In particular efficient sufficient conditions for liveness have not been found until now. In this paper, we extend results on weighted T-systems to the class of weighted Petri nets and present transformations which preserve the feasible sequences of transitions and reduce the initial marking. We introduce a notion of \"balancing\" that makes possible the transformation of conservative systems into so-called \"1-conservative systems\" while retaining the feasible transition sequences. This transformation leads to polynomial sufficient conditions of liveness for well-formed Join-Free and Choice-Free nets.","PeriodicalId":166715,"journal":{"name":"2013 13th International Conference on Application of Concurrency to System Design","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115642793","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}

引用次数: 10

Reveal Your Faults: It's Only Fair! 揭露你的缺点:这样才公平!

2013 13th International Conference on Application of Concurrency to System Design Pub Date : 2013-07-08 DOI: 10.1109/ACSD.2013.15

S. Haar, César Rodríguez, Stefan Schwoon

引用次数: 15

Implementing Timed Automata Specifications: The "Sandwich" Approach 实现定时自动机规范:“三明治”方法

2013 13th International Conference on Application of Concurrency to System Design Pub Date : 2013-07-08 DOI: 10.1109/ACSD.2013.26

Raymond R. Devillers, Jean-Yves Didier, Hanna Klaudel

引用次数: 6

Prototyping a Concurrency Model 一个并发模型的原型

2013 13th International Conference on Application of Concurrency to System Design Pub Date : 2013-07-08 DOI: 10.1109/ACSD.2013.21

Benjamin Morandi, M. Schill, Sebastian Nanz, B. Meyer

引用次数: 21

Maximal Synthesis for Hennessy-Milner Logic Hennessy-Milner逻辑的最大合成

2013 13th International Conference on Application of Concurrency to System Design Pub Date : 2013-07-08 DOI: 10.1145/2680540

Allan van Hulst, M. Reniers, W. Fokkink

引用次数: 30

Factored Planning: From Automata to Petri Nets 因子规划:从自动机到Petri网

2013 13th International Conference on Application of Concurrency to System Design Pub Date : 2013-07-08 DOI: 10.1145/2656215

L. Jezequel, É. Fabre, Victor Khomenko

引用次数: 8

Timing Analysis of Binary Programs with UPPAAL 基于UPPAAL的二进制程序时序分析

2013 13th International Conference on Application of Concurrency to System Design Pub Date : 2013-07-08 DOI: 10.1109/ACSD.2013.7

F. Cassez, Jean-Luc Béchennec

引用次数: 17