Non-sequential Behaviour of Dynamic Nets
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.
KeywordsCausal Structure Operational Semantic Deterministic Process Process Pattern Graph Transformation System
Unable to display preview. Download preview PDF.
- 1.Asperti, A., Busi, N.: Mobile Petri nets. Technical Report UBLCS 96-10, Computer Science Department, University of Bologna (1996)Google Scholar
- 6.Conchon, S., Le Fessant, F.: Jocaml: Mobile agents for Objective-Caml. In: Proc. ASA 1999 / MA 1999, pp. 22–29. IEEE, Los Alamitos (1999)Google Scholar
- 9.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)Google Scholar
- 11.Melgratti, H.: Models and Languages for Global Computing Transactions. PhD thesis, Computer Science Department, University of Pisa (2005)Google Scholar
- 13.Petri, C.A.: Kommunikation mit Automaten. PhD thesis, Institut für Instrumentelle Mathematik, Bonn (1962)Google Scholar