Abstract
The hierarchical process structure of Petri nets can be modelled by languages of series-parallel posets. We show how to extract this structure from a 1-safe Petri net. The technique also applies to represent 1-safe S-systems [11] and communication-free systems [5] in terms of structured programs with cobegin-coend. We also define SR-systems, a class of 1-safe Petri nets which exactly represents programs of this kind.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Best, E., Devillers, R., Koutny, M.: Petri net algebra. Springer, Heidelberg (2001)
Best, E., Wimmel, H.: Reducing k-safe Petri nets to pomset-equivalent 1-safe Petri nets. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol. 1825, pp. 63–82. Springer, Heidelberg (2000)
Degano, P., de Nicola, R., Montanari, U.: A partial order semantics for CCS. TCS 75, 223–262 (1990)
Diekert, V., Rozenberg, G. (eds.): The book of traces. World Scientific, Singapore (1995)
Esparza, J.: Petri nets, commutative context-free grammars, and basic parallel processes. Fund. Inf. 30, 23–41 (1997)
Garg, V.K., Ragunath, M.T.: Concurrent regular expressions and their relationship to Petri nets. TCS 96, 285–304 (1992)
Gischer, J.L.: The equational theory of pomsets. TCS 61, 199–224 (1988)
van Glabbeek, R.J., Vaandrager, F.W.: Petri net models for algebraic theories of concurrency. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE 1987. LNCS, vol. 259, pp. 224–242. Springer, Heidelberg (1987)
Goltz, U., Mycroft, A.: On representing CCS programs by finite Petri nets. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol. 172, pp. 196–208. Springer, Heidelberg (1984)
Grabowski, J.: On partial languages. Fund. Inform. IV, 427–498 (1981)
Hack, M.H.T.: Analysis of production schemata by Petri nets, M.S. thesis, Dept. Elec. Engg., MIT (1972)
Kuske, D.: Towards a language theory for infinite N-free posets. TCS 299, 347–386 (2003)
Lodaya, K., Weil, P.: Series-parallel languages and the bounded-width property. TCS 237, 347–380 (2000)
Ochmański, E.: Regular behaviour of concurrent systems, Bull. EATCS 27, 56–67 (1985)
Olderog, E.-R.: Nets, terms and formulas, Cambridge (1991)
Petri, C.-A.: Fundamentals of a theory of asynchronous information flow. In: Popplewell, C.M. (ed.) Proc. IFIP, Münich, pp. 386–390. North-Holland, Amsterdam (1962)
Pratt, V.: Modelling concurrency with partial orders. IJPP 15(1), 33–71 (1986)
Ranganayakulu, D., Lodaya, K.: Infinite series-parallel posets of 1-safe nets. In: Thangavel, P. (ed.) Proc. Algorithms & Artificial Systems, Allied, pp. 107–124 (2003)
Reisig, W.: Petri nets, an introduction. Springer, Heidelberg (1985)
Taubner, D.: Finite Representations of CCS and TCSP Programs by Automata and Petri Nets. LNCS, vol. 369. Springer, Heidelberg (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lodaya, K., Ranganayakulu, D., Rangarajan, K. (2003). Hierarchical Structure of 1-Safe Petri Nets. In: Saraswat, V.A. (eds) Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation. ASIAN 2003. Lecture Notes in Computer Science, vol 2896. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40965-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-40965-6_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20632-3
Online ISBN: 978-3-540-40965-6
eBook Packages: Springer Book Archive