Concurrent Implementation of Asynchronous Transition Systems
The synthesis problem is to decide for a deterministic transition system whether a Petri net with an isomorphic reachability graph exists and in case to find such a net (which must have the arc-labels of the transition system as transitions). In this paper, we weaken isomorphism to some form of bisimilarity that also takes concurrency into account and we consider safe nets that may have additional internal transitions. To speak of concurrency, the transition system is enriched by an independence relation to an asynchronous transition system. For an arbitrary asynchronous transition system, we construct an ST-bisimilar net. We show how to decide effectively whether there exists a bisimilar net without internal transitions, in which case we can also find a history-preserving bisimilar net without internal transitions. Finally, we present a construction that inserts a new internal event into an asynchronous transition system such that the result is history-preserving bisimilar; this construction can help to find a history-preserving bisimilar net (with internal transitions).
Unable to display preview. Download preview PDF.
- BBD95.E. Badouel, L. Bernardinello, and P. Darondeau. Polynomial algorithms for the synthesis of bounded nets. In P. Mosses et al., editors, TAPSOFT 95, Lect. Notes Comp. Sci. 915, 364–378. Springer, 1995.Google Scholar
- Dar98.P. Darondeau. Deriving unbounded Petri nets from formal languages. In D. Sangiorgi and R. de Simone, editors, CONCUR 98, Lect. Notes Comp. Sci. 1466, 533–548. Springer, 1998.Google Scholar
- DS93.M. Droste and R.M. Shortt. Petri nets and automata with concurrency relations — an adjunction. In M. Droste et al., editors, Semantics of Programming Languages and Model Theory. Gordon and Breach, 69–87. 1993.Google Scholar
- GV87.R.J. v. Glabbeek and F. Vaandrager. Petri net models for algebraic theories of concurrency. In J.W. de Bakker et al., editors, PARLE Vol. II, Lect. Notes Comp. Sci. 259, 224–242. Springer, 1987.Google Scholar
- HKT92.P. Hoogers, H. Kleijn, and P.S. Thiagarajan. A trace semantics for Petri nets. In W. Kuich, editor, Automata, Languages and Programming, ICALP 1992, Lect. Notes Comp. Sci. 623, 595–604. Springer, 1992.Google Scholar
- NW95.M. Nielsen and G. Winskel. Models for concurrency. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science Vol. 4, pages 1–148. Oxford Univ. Press, 1995.Google Scholar
- PKY95.M. Pietkiewicz-Koutny and A. Yakovlev. Non-pure nets and their transition systems. Technical Report TR 528, Dept. Comp. Sci., Univ. of Newcastle upon Tyne, 1995.Google Scholar
- Sun98.K. Sunesen. Reasoning about Reactive Systems. PhD thesis, Univ. Aarhus, 1998.Google Scholar
- Vog92.W. Vogler. Modular Construction and Partial Order Semantics of Petri Nets. Lect. Notes Comp. Sci. 625. Springer, 1992.Google Scholar