We propose to extend time arc Petri nets by associating with each transition a strong or a weak firing semantics. The proposed model includes the semantics of existing time Petri nets where time intervals are associated with places, transitions and arcs in their weak and strong semantics. We show afterwards that state space abstraction techniques for constructing zone graphs can be adapted to the proposed model. For the theory of time Petri nets this result gives the decidability of k-boundedness, markingreachability and language emptiness problems for the proposed model and all its sub-classes.
{"title":"Time Arc Petri Nets and Their Analysis","authors":"Hind Rakkay, H. Boucheneb, O. Roux","doi":"10.1109/ACSD.2009.21","DOIUrl":"https://doi.org/10.1109/ACSD.2009.21","url":null,"abstract":"We propose to extend time arc Petri nets by associating with each transition a strong or a weak firing semantics. The proposed model includes the semantics of existing time Petri nets where time intervals are associated with places, transitions and arcs in their weak and strong semantics. We show afterwards that state space abstraction techniques for constructing zone graphs can be adapted to the proposed model. For the theory of time Petri nets this result gives the decidability of k-boundedness, markingreachability and language emptiness problems for the proposed model and all its sub-classes.","PeriodicalId":307821,"journal":{"name":"2009 Ninth International Conference on Application of Concurrency to System Design","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131220167","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}
Silvia Crafa, Francesco Ranzato, Francesco Tapparo
A number of algorithms are available for computing the simulation relation on Kripke structures and on labelled transition systems representing concurrentsystems. Among them, the algorithm by Ranzato and Tapparo~[2007] has the best time complexity, while the algorithm by Gentilini et al.~[2003]~--~successivelycorrected by van Glabbeek and Ploeger~[2008]~--~has thebest space complexity. Both space and time complexities are critical issues in a simulation algorithm, in particular memory requirements are crucial in the context of model checking when dealing with large state spaces.We propose here a new simulation algorithm thatis obtained as a space saving modification of the time efficient algorithm by Ranzato and Tapparo: a symbolic representation of sets is embedded in thisalgorithm so that any set of states manipulated by the algorithm can be efficiently stored as a set of blocks of a suitable state partition. It turns out that this new simulation algorithm retains a space complexity comparable with Gentilini et al.'s algorithm while improving on Gentilini et al.'s time bound.
{"title":"Saving Space in a Time Efficient Simulation Algorithm","authors":"Silvia Crafa, Francesco Ranzato, Francesco Tapparo","doi":"10.3233/FI-2011-412","DOIUrl":"https://doi.org/10.3233/FI-2011-412","url":null,"abstract":"A number of algorithms are available for computing the simulation relation on Kripke structures and on labelled transition systems representing concurrentsystems. Among them, the algorithm by Ranzato and Tapparo~[2007] has the best time complexity, while the algorithm by Gentilini et al.~[2003]~--~successivelycorrected by van Glabbeek and Ploeger~[2008]~--~has thebest space complexity. Both space and time complexities are critical issues in a simulation algorithm, in particular memory requirements are crucial in the context of model checking when dealing with large state spaces.We propose here a new simulation algorithm thatis obtained as a space saving modification of the time efficient algorithm by Ranzato and Tapparo: a symbolic representation of sets is embedded in thisalgorithm so that any set of states manipulated by the algorithm can be efficiently stored as a set of blocks of a suitable state partition. It turns out that this new simulation algorithm retains a space complexity comparable with Gentilini et al.'s algorithm while improving on Gentilini et al.'s time bound.","PeriodicalId":307821,"journal":{"name":"2009 Ninth International Conference on Application of Concurrency to System Design","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126364799","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}
A new way of constructing N-way arbiters is proposed. The main idea is to perform arbitrations between all pairs of requests, and then make decision on what grant to issue based on their outcomes. Crucially, all the mutual exclusion elements in such an arbiter work in parallel.This ‘flat’ arbitration is prone to new threats such as formation of cycles (leading to deadlocks), but at the same time opens up new opportunities for designing arbitration structures with different decision policies due to the availability of the global order relation between requests. To facilitate resolution of such cycles and further developments in the context of flat arbitration, the paper presents new theoretical results, including a proof of correctness of a generic structure for the N-way arbiter decision logic. In particular, in some situations a request that lost some pairwise arbitrations has to be granted to avoid a deadlock.
{"title":"Flat Arbiters","authors":"A. Mokhov, Victor Khomenko, A. Yakovlev","doi":"10.3233/FI-2011-414","DOIUrl":"https://doi.org/10.3233/FI-2011-414","url":null,"abstract":"A new way of constructing N-way arbiters is proposed. The main idea is to perform arbitrations between all pairs of requests, and then make decision on what grant to issue based on their outcomes. Crucially, all the mutual exclusion elements in such an arbiter work in parallel.This ‘flat’ arbitration is prone to new threats such as formation of cycles (leading to deadlocks), but at the same time opens up new opportunities for designing arbitration structures with different decision policies due to the availability of the global order relation between requests. To facilitate resolution of such cycles and further developments in the context of flat arbitration, the paper presents new theoretical results, including a proof of correctness of a generic structure for the N-way arbiter decision logic. In particular, in some situations a request that lost some pairwise arbitrations has to be granted to avoid a deadlock.","PeriodicalId":307821,"journal":{"name":"2009 Ninth International Conference on Application of Concurrency to System Design","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123222560","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}
We propose a general method to characterize and synthesizecorrectness-preserving, asynchronous wrappers for synchronousprocesses on a globally asynchronous locally synchronous (GALS)architecture. Based on the theory of weakly endochronous systems, ourtechnique uses a compact representation of the abstractsynchronization configurations of the analyzed process to determine aminimal set of synchronization patterns generating all possiblereactions.
{"title":"From Concurrent Multi-clock Programs to Deterministic Asynchronous Implementations","authors":"D. Potop-Butucaru, Y. Sorel, R. Simone, J. Talpin","doi":"10.3233/FI-2011-415","DOIUrl":"https://doi.org/10.3233/FI-2011-415","url":null,"abstract":"We propose a general method to characterize and synthesizecorrectness-preserving, asynchronous wrappers for synchronousprocesses on a globally asynchronous locally synchronous (GALS)architecture. Based on the theory of weakly endochronous systems, ourtechnique uses a compact representation of the abstractsynchronization configurations of the analyzed process to determine aminimal set of synchronization patterns generating all possiblereactions.","PeriodicalId":307821,"journal":{"name":"2009 Ninth International Conference on Application of Concurrency to System Design","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115331118","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}
State-based representations of concurrent systems suffer from the well known state explosion problem. In contrast, Petri nets are good models for this type of systems both in terms of complexity of the analysis and in visualization of the model. In this paper we present Genet, a tool that allows the derivation of a general Petri net from a state-based representation of a system. The tool supports two modes of operation: synthesis and mining. Applications of these two modes range from synthesis of digital systems to Business Intelligence.
{"title":"Genet: A Tool for the Synthesis and Mining of Petri Nets","authors":"J. Carmona, J. Cortadella, M. Kishinevsky","doi":"10.1109/ACSD.2009.6","DOIUrl":"https://doi.org/10.1109/ACSD.2009.6","url":null,"abstract":"State-based representations of concurrent systems suffer from the well known state explosion problem. In contrast, Petri nets are good models for this type of systems both in terms of complexity of the analysis and in visualization of the model. In this paper we present Genet, a tool that allows the derivation of a general Petri net from a state-based representation of a system. The tool supports two modes of operation: synthesis and mining. Applications of these two modes range from synthesis of digital systems to Business Intelligence.","PeriodicalId":307821,"journal":{"name":"2009 Ninth International Conference on Application of Concurrency to System Design","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133119000","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}
Jean-Baptiste Raclet, Éric Badouel, A. Benveniste, B. Caillaud, Roberto Passerone
In this paper we revisit the fundamentals of interface theories. Methodological considerations call for supporting ``aspects'' and ``assume/guarantee'' reasoning. From these considerations, we show that, in addition to the now classical refinement and substitutability properties of interfaces, two additional operations are needed, namely: conjunction and residuation (or quotient). We draw the attention to the difficulty in handling interfaces having different alphabets --- which calls for alphabet equalization. We show that alphabet equalization must be performed differently for the different operations. Then, we show that Modal Interfaces, as adapted from the original proposal by Kim Larsen, offer the needed flexibility.
{"title":"Why Are Modalities Good for Interface Theories?","authors":"Jean-Baptiste Raclet, Éric Badouel, A. Benveniste, B. Caillaud, Roberto Passerone","doi":"10.1109/ACSD.2009.22","DOIUrl":"https://doi.org/10.1109/ACSD.2009.22","url":null,"abstract":"In this paper we revisit the fundamentals of interface theories. Methodological considerations call for supporting ``aspects'' and ``assume/guarantee'' reasoning. From these considerations, we show that, in addition to the now classical refinement and substitutability properties of interfaces, two additional operations are needed, namely: conjunction and residuation (or quotient). We draw the attention to the difficulty in handling interfaces having different alphabets --- which calls for alphabet equalization. We show that alphabet equalization must be performed differently for the different operations. Then, we show that Modal Interfaces, as adapted from the original proposal by Kim Larsen, offer the needed flexibility.","PeriodicalId":307821,"journal":{"name":"2009 Ninth International Conference on Application of Concurrency to System Design","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131641306","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}
In a service-oriented architecture (SOA), a service broker assigns a previously published service (stored in a service registry) to a service requester. It is desirable for the composition of the requesting and the assigned service to interact properly. While proper interaction is often reducedto deadlock freedom of the composed system, we additionally consider livelock freedom as a desirable property for the interaction of services. In principle, deadlock- and livelock freedom can be verified by inspecting the state space of the composition of (public views of) the involvedservices.The contribution of this paper is to propose a methodology to build that state space from pre-computed fragments which are computed upon publishing a service. That way, we shiftcomputation time from the time critical request phase of service brokerage to the less critical publish phase. Interestingly, our setting enables state space reduction methods that are intrinsically different from traditional state space reductions.
{"title":"Verifying Deadlock- and Livelock Freedom in an SOA Scenario","authors":"K. Wolf, C. Stahl, Janine Ott, Robert Danitz","doi":"10.1109/ACSD.2009.16","DOIUrl":"https://doi.org/10.1109/ACSD.2009.16","url":null,"abstract":"In a service-oriented architecture (SOA), a service broker assigns a previously published service (stored in a service registry) to a service requester. It is desirable for the composition of the requesting and the assigned service to interact properly. While proper interaction is often reducedto deadlock freedom of the composed system, we additionally consider livelock freedom as a desirable property for the interaction of services. In principle, deadlock- and livelock freedom can be verified by inspecting the state space of the composition of (public views of) the involvedservices.The contribution of this paper is to propose a methodology to build that state space from pre-computed fragments which are computed upon publishing a service. That way, we shiftcomputation time from the time critical request phase of service brokerage to the less critical publish phase. Interestingly, our setting enables state space reduction methods that are intrinsically different from traditional state space reductions.","PeriodicalId":307821,"journal":{"name":"2009 Ninth International Conference on Application of Concurrency to System Design","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123686312","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}
We show that the problems of checking pi-Calculus structural congruence (piSC) and graph isomorphism (GI) are Karp reducible to each other. The reduction from GI to piSC is given explicitly, and the reduction in the opposite direction proceeds by transforming piSC into an instance of the term equality problem (i.e. the problem of deciding equivalence of two terms in the presence of associative and/or commutative operations and commutative variable-binding quantifiers), which is known to be Karp reducible to GI. Our result is robust in the sense that it holds for several variants of structural congruence and some rather restrictive fragments of pi-Calculus.Furthermore, we address the question of solving piSC in practice, and describe a number of optimisations exploiting specific features of pi-Calculus terms, which allow one to significantly reduce the size of the resulting graphs that have to be checked for isomorphism.
{"title":"Checking pi-Calculus Structural Congruence is Graph Isomorphism Complete","authors":"Victor Khomenko, R. Meyer","doi":"10.1109/ACSD.2009.8","DOIUrl":"https://doi.org/10.1109/ACSD.2009.8","url":null,"abstract":"We show that the problems of checking pi-Calculus structural congruence (piSC) and graph isomorphism (GI) are Karp reducible to each other. The reduction from GI to piSC is given explicitly, and the reduction in the opposite direction proceeds by transforming piSC into an instance of the term equality problem (i.e. the problem of deciding equivalence of two terms in the presence of associative and/or commutative operations and commutative variable-binding quantifiers), which is known to be Karp reducible to GI. Our result is robust in the sense that it holds for several variants of structural congruence and some rather restrictive fragments of pi-Calculus.Furthermore, we address the question of solving piSC in practice, and describe a number of optimisations exploiting specific features of pi-Calculus terms, which allow one to significantly reduce the size of the resulting graphs that have to be checked for isomorphism.","PeriodicalId":307821,"journal":{"name":"2009 Ninth International Conference on Application of Concurrency to System Design","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115747007","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}
The application of synthesis of Petri nets from languagesfor practical problems has recently attracted increasing attention.However, the classical synthesis problems are oftennot appropriate in realistic settings, because usually it isnot asked for plain-vanilla Petri net synthesis, but specificadditional requirements have to be considered. Having thisin mind, we in this paper survey variants of the classicallanguage based synthesis problems and develop respectivesolution algorithms. This yields a large repertoire of synthesisprocedures presented in a uniform way.
{"title":"Variants of the Language Based Synthesis Problem for Petri Nets","authors":"S. Mauser, R. Lorenz","doi":"10.1109/ACSD.2009.19","DOIUrl":"https://doi.org/10.1109/ACSD.2009.19","url":null,"abstract":"The application of synthesis of Petri nets from languagesfor practical problems has recently attracted increasing attention.However, the classical synthesis problems are oftennot appropriate in realistic settings, because usually it isnot asked for plain-vanilla Petri net synthesis, but specificadditional requirements have to be considered. Having thisin mind, we in this paper survey variants of the classicallanguage based synthesis problems and develop respectivesolution algorithms. This yields a large repertoire of synthesisprocedures presented in a uniform way.","PeriodicalId":307821,"journal":{"name":"2009 Ninth International Conference on Application of Concurrency to System Design","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116968721","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}
We present a formal semantics for a subset of Verilog, commonly used todescribe cell libraries, in terms of transition systems.Such transition systems can serve as input to symbolic model checking,for example equivalence checking with a transistor netlist description. Weimplement our formal semantics as an encoding from the subset of Verilog tothe input language of the SMV model-checker.Experiments show that this approach is able to verify complete cell libraries.
{"title":"Model Checking Verilog Descriptions of Cell Libraries","authors":"M. Raffelsieper, J. Roorda, M. Mousavi","doi":"10.1109/ACSD.2009.18","DOIUrl":"https://doi.org/10.1109/ACSD.2009.18","url":null,"abstract":"We present a formal semantics for a subset of Verilog, commonly used todescribe cell libraries, in terms of transition systems.Such transition systems can serve as input to symbolic model checking,for example equivalence checking with a transistor netlist description. Weimplement our formal semantics as an encoding from the subset of Verilog tothe input language of the SMV model-checker.Experiments show that this approach is able to verify complete cell libraries.","PeriodicalId":307821,"journal":{"name":"2009 Ninth International Conference on Application of Concurrency to System Design","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129089907","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：