Abstract
Dynamic nets are an extension of Petri nets where the net topology may change dynamically. This is achieved by allowing (i) tokens to be coloured with place names (carried on as data), (ii) transitions to designate places where to spawn new tokens on the basis of the colours in the fetched tokens, and (iii) firings to add fresh places and transitions to the net. Dynamic nets have been given step or interleaving semantics but, to the best of our knowledge, their non-sequential truly concurrent semantics has not been addressed in the literature. To fill this gap, we extend the ordinary notions of processes and unfolding to dynamic nets, providing two different constructions: (i) a specific process and unfolding for a particular initial marking, and (ii) processes and unfolding patterns that abstract away from the colours of the token initially available.
Research supported by the EU FET-GC2 IST-2004-16004 Integrated Project Sensoria.
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
Asperti, A., Busi, N.: Mobile Petri nets. Technical Report UBLCS 96-10, Computer Science Department, University of Bologna (1996)
Baldan, P., Corradini, A., König, B.: A static analysis technique for graph transformation systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 381–395. Springer, Heidelberg (2001)
Benton, N., Cardelli, L., Fournet, C.: Modern concurrency abstractions for C\(^{\sharp}\). In: Magnusson, B. (ed.) ECOOP 2002. LNCS, vol. 2374, pp. 415–440. Springer, Heidelberg (2002)
Bruni, R., Melgratti, H., Montanari, U.: Extending the zero-safe approach to coloured, reconfigurable and dynamic nets. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol. 3098, pp. 291–327. Springer, Heidelberg (2004)
Buscemi, M., Sassone, V.: High-level Petri nets as type theories in the Join calculus. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol. 2030, pp. 104–120. Springer, Heidelberg (2001)
Conchon, S., Le Fessant, F.: Jocaml: Mobile agents for Objective-Caml. In: Proc. ASA 1999 / MA 1999, pp. 22–29. IEEE, Los Alamitos (1999)
Fournet, C., Gonthier, G.: The reflexive chemical abstract machine and the Join calculus. In: Proc. POPL 1996, pp. 372–385. ACM Press, New York (1996)
Goltz, U., Reisig, W.: The non-sequential behaviour of Petri nets. Inform. and Comput. 57, 125–147 (1983)
Gunter, C., Scott, D.: Semantic domains. In: Handbook of Theoretical Computer Science. Formal Models and Sematics, vol. B, pp. 633–674. MIT Press, Cambridge (1990)
McMillan, K.L.: Symbolic Model Checking. Kluwer, Dordrecht (1993)
Melgratti, H.: Models and Languages for Global Computing Transactions. PhD thesis, Computer Science Department, University of Pisa (2005)
Meseguer, J., Montanari, U., Sassone, V.: Process versus unfolding semantics for place/transition Petri nets. Theoret. Comput. Sci. 153(1-2), 171–210 (1996)
Petri, C.A.: Kommunikation mit Automaten. PhD thesis, Institut für Instrumentelle Mathematik, Bonn (1962)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bruni, R., Melgratti, H. (2006). Non-sequential Behaviour of Dynamic Nets. In: Donatelli, S., Thiagarajan, P.S. (eds) Petri Nets and Other Models of Concurrency - ICATPN 2006. ICATPN 2006. Lecture Notes in Computer Science, vol 4024. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11767589_7
Download citation
DOI: https://doi.org/10.1007/11767589_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34699-9
Online ISBN: 978-3-540-34700-2
eBook Packages: Computer ScienceComputer Science (R0)