Unfolding and finite prefix for nets with read arcs
Petri nets with read arcs are investigated w.r.t their unfolding, where read arcs model reading without consuming, which is often more adequate than the destructive-read-and-rewrite modelled with loops in ordinary nets. The paper redefines the concepts of a branching process and unfolding for nets with read arcs and proves that the set of reachable markings of a net is completely represented by its unfolding. The specific feature of branching processes of nets with read arcs is that the notion of a co-set is no longer based only on the binary concurrency relation between the elements of the unfolding, contrary to ordinary nets. It is shown that the existing conditions for finite prefix construction (McMillan's one and its improvement by Esparza et al.) can only be applied for a subclass of nets with read arcs, the so-called read-persistent nets. Though being restrictive, this subclass is sufficiently practical due to its conformance to the notion of hazard-freedom in logic circuits. The latter appear to be one of the most promising applications for nets with read arcs.
Keywordsasynchronous circuits branching processes concurrency semantics hazards Petri nets with read arcs read-persistence unfolding
Unable to display preview. Download preview PDF.
- [BCM98]P. Baldan, A. Corradini and U. Montanari. An event structure semantics for P/T contextual nets: asymmetric event structures. to appear in Proc. FoSSaCS'98, April 1998, Lisbon.Google Scholar
- [BG95]N. Busi and R. Gorrieri. A Petri net semantics for π-calculus. In L. Insup and S. Smolka, editors, CONCUR 95, Lect. Notes Comp. Sci. 962, 145–159. Springer, 1995.Google Scholar
- [BP96]N. Busi and M. Pinna. Non-sequential semantics for contextual P/T-nets. In J. Billington and W. Reisig, editors, Applications and Theory of Petri Nets 1996, Lect. Notes Comp. Sci. 1091, 113–132. Springer, 1996.Google Scholar
- [CH93]S. Christensen and N.D. Hansen. Coloured Petri nets extended with place capacities, test arcs, and inhibitor arcs. In M. Ajmone-Marsan, editor, Applications and Theory of Petri Nets 1993, Lect. Notes Comp. Sci. 691, 186–205. Springer, 1993.Google Scholar
- [EM97]J. Esparza and S. Melzer. Model Checking LTL Using Constraint Programming In P. Azema and G. Balbo, editors, Applications and Theory of Petri Nets 1997, Lect. Notes Comp. Sci. 1248, 1–20. Springer, 1997.Google Scholar
- [ERV96]J. Esparza, S. Römer, and W. Vogler. An improvement of McMillan's unfolding algorithm. In T. Margaria and B. Steffen, editors, TACAS 96, Lect. Notes Comp. Sci. 1055, 87–106. Springer, 1996.Google Scholar
- [McM93]K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, Boston, 1993.Google Scholar
- [SY97]A. Semenov and A. Yakovlev. Contextual net unfolding and asynchronous circuit verification Technical Report Series No. 572, Computing Science, University of Newcastle upon Tyne, April 1997. See http://www.cs.ncl.ac.uk/research/trs/lists/97.html.Google Scholar
- [Vog97]W. Vogler. Partial order semantics and read arcs. Technical Report 1997-1, Inst. f. Informatik, Univ. Augsburg, 1997. See http://www.math.uni-augsburg.de/~vogler/; extended abstract in MFCS 97, LNCS 1295, 508–517.Google Scholar
- [VSY98]W. Vogler, A. Semenov and A. Yakovlev. Unfolding and finite prefix for nets with read arcs. Technical Report Series No. 634, Computing Science, University of Newcastle upon Tyne, February 1998 (can be obtained from: ftp://sadko.ncl.ac.uk/pub/incoming/TRs/).Google Scholar