Process versus unfolding semantics for Place/Transition Petri nets
DOI10.1016/0304-3975(95)00121-2zbMath0872.68130OpenAlexW2052906135MaRDI QIDQ672872
Vladimiro Sassone, Ugo Montanari, José Meseguer
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00121-2
monoidal categoriesplace/transition netsdecorated occurrence netsdecorated processesnonsequential processesunfolding constructions
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (14)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An event structure semantics for general Petri nets
- Petri nets are monoids
- Petri nets, algebras, morphisms, and compositionality
- A distributed operational semantics of CCS based on condition/event systems
- Sequential and concurrent behaviour in Petri net theory
- Petri nets, event structures and domains. I
- Branching processes of Petri nets
- Mathematical aspects of net theory
- Special issue: F-WAN, foundations of wide area network computing. Selected papers based on the presentation at the meeting, Málaga, Spain, July 12--13, 2002.
- Axiomatizing the algebra of net computations and processes
- The non-sequential behaviour of Petri nets
- FROM PETRI NETS TO LINEAR LOGIC THROUGH CATEGORIES: A SURVEY
- PETRI NETS AND STEP TRANSITION SYSTEMS
- Axiomatizing Petri net concatenable processes
- On the category of Petri net computations
This page was built for publication: Process versus unfolding semantics for Place/Transition Petri nets