Abstract
The notion of unfolding plays a major role in the so called non sequential semantics of Petri nets, as well as in model checking of concurrent and distributed systems or in control theory. In literature various approaches to this notion have been proposed, where dependencies among events are represented either taking into account the whole history of the event (the so called individual token philosophy) or considering the whole history irrelevant (the so called collective token philosophy). In this paper we propose two unfoldings where the history is partially kept. These notions are based on unravelling a net rather than unfolding it. We compare them with the classical ones and we put all of them together in a coherent framework.
Work partially supported by the CGR Coarse Grain Recommendation-project, PIA “Industria, Artigianato e Servizi”, Regione Autonoma della Sardegna, and TESLA, L.R. 7/2007, Regione Autonoma della Sardegna.
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.
Similar content being viewed by others
References
Winskel, G.: Event Structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 255, pp. 325–392. Springer, Heidelberg (1987)
Engelfriet, J.: Branching processes of Petri nets. Acta Informatica 28, 575–591 (1991)
Baldan, P., Corradini, A., Montanari, U.: Contextual Petri nets, asymmetric event structures and processes. Information and Computation 171, 1–49 (2001)
Baldan, P., Busi, N., Corradini, A., Pinna, G.: Domain and event structure semantics for Petri nets with read and inhibitor arcs. Theoretical Computer Science 323, 129–189 (2004)
van Glabbeek, R.J., Plotkin, G.D.: Configuration structures. In: Kozen, D. (ed.) Proceedings of 10th Annual IEEE Symposium on Logic in Computer Science, pp. 199–209. IEEE Computer Society Press, Los Alamitos (1995)
Gunawardena, J.: A generalized event structure for the Muller unfolding of a safe net. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 278–292. Springer, Heidelberg (1993)
Gunawardena, J.: Geometric logic, causality and event structures. In: Groote, J.F., Baeten, J.C.M. (eds.) CONCUR 1991. LNCS, vol. 527, pp. 266–280. Springer, Heidelberg (1991)
Gunawardena, J.: Causal automata. Theoretical Computer Science 101, 265–288 (1992)
Hoogers, P.W., Kleijn, H.C.M., Thiagarajan, P.S.: An event structure semantics for general Petri nets. Theoretical Computer Science 153, 129–170 (1996)
Lorenz, R., Juhás, G., Bergenthum, R., Desel, J., Mauser, S.: Executability of scenarios in Petri nets. Theoretical Computer Science 410, 1190–1216 (2009)
Khomenko, V., Kondratyev, A., Koutny, M., Vogler, W.: Merged processes: a new condensed representation of Petri net behaviour. Acta Informatica 43, 307–330 (2006)
Fabre, E.: Trellis processes: A compact representation for runs of concurrent systems. Discrete Event Dynamic Systems 17, 267–306 (2007)
van Glabbeek, R.J.: The individual and collective token interpretations of petri nets. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 323–337. Springer, Heidelberg (2005)
Pinna, G.M.: Petri nets unfoldings and the individual/collective token philosophy. In: Ambos-Spies, K., Löwe, B., Merkle, W. (eds.) CiE 2009. LNCS, vol. 5635, pp. 279–288. Springer, Heidelberg (2009)
Reisig, W.: Petri Nets: An Introduction. EACTS Monographs on Theoretical Computer Science. Springer, Heidelberg (1985)
Hayman, J., Winskel, G.: The unfolding of general Petri nets. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2008),, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pinna, G.M. (2011). How Much Is Worth to Remember? A Taxonomy Based on Petri Nets Unfoldings. In: Kristensen, L.M., Petrucci, L. (eds) Applications and Theory of Petri Nets. PETRI NETS 2011. Lecture Notes in Computer Science, vol 6709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21834-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-21834-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21833-0
Online ISBN: 978-3-642-21834-7
eBook Packages: Computer ScienceComputer Science (R0)