Browse by author
Lookup NU author(s): Dr Fei Xia
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In previous work, an automatic ACM synthesis method based on the generation of the reachability graph and the theory of regions was proposed. In this paper, we propose a new synthesis method based on the composition of Petri net modules, avoiding the exploration of the reachability graph. The behavior of ACMs is formally defined and correctness properties are specified in CTL. Model checking is used to verify the correctness of the Petri net models. The algorithms to generate the Petri net models are presented. Finally, a method to automatically generate C++ source code from the Petri net model is described.
Author(s): Gorgônio K, Cortadella J, Xia F
Editor(s): Kleijn, J; Yakovlev, A
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: 28th International Conference on Application and Theory of Petri Nets and Other Models of Concurrency (Petri nets)
Year of Conference: 2007
Pages: 144-163
ISSN: 0302-9743 (Print) 1611-3349 (Online)
Publisher: Springer
URL: http://dx.doi.org/10.1007/978-3-540-73094-1_11
DOI: 10.1007/978-3-540-73094-1_11
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science
ISBN: 9783540730934
