Process versus unfolding semantics for Place/Transition Petri nets
DOI10.1016/0304-3975(95)00121-2zbMATH Open0872.68130OpenAlexW2052906135MaRDI QIDQ672872FDOQ672872
Authors: José Meseguer, Ugo Montanari, Vladimiro Sassone 
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
Recommendations
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)
Cites Work
- Petri nets, event structures and domains. I
- Title not available (Why is that?)
- Title not available (Why is that?)
- The non-sequential behaviour of Petri nets
- Title not available (Why is that?)
- Branching processes of Petri nets
- An event structure semantics for general Petri nets
- PETRI NETS AND STEP TRANSITION SYSTEMS
- Sequential and concurrent behaviour in Petri net theory
- Title not available (Why is that?)
- Petri nets are monoids
- A distributed operational semantics of CCS based on condition/event systems
- Petri nets, algebras, morphisms, and compositionality
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- FROM PETRI NETS TO LINEAR LOGIC THROUGH CATEGORIES: A SURVEY
- Title not available (Why is that?)
- Axiomatizing Petri net concatenable processes
- On the category of Petri net computations
Cited In (17)
- Functorial models for Petri nets
- Whole-grain Petri nets and processes
- Concurrency for Graph Grammars in a Petri net shell
- Title not available (Why is that?)
- On the semantics of place/transition Petri nets
- Semantic domains of timed event structures
- Algebraic characterization of petri net pomset semantics
- Title not available (Why is that?)
- Unfolding semantics of graph transformation
- Models of Computation: A Tribute to Ugo Montanari’s Vision
- Zero-safe nets: Comparing the collective and individual token approaches.
- Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework
- On a homomorphism of a component Petri net
- The synthesis problem for repeatedly communicating Petri games
- Contextual Petri nets, asymmetric event structures, and processes
- Domain and event structure semantics for Petri nets with read and inhibitor arcs
- Petri games: synthesis of distributed systems with causal memory
This page was built for publication: Process versus unfolding semantics for Place/Transition Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672872)
