An event structure semantics for general Petri nets
DOI10.1016/0304-3975(95)00120-4zbMATH Open0872.68126OpenAlexW2089336326MaRDI QIDQ672871FDOQ672871
P. W. Hoogers, Jetty Kleijn, P. S. Thiagarajan
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)00120-4
Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Petri nets, event structures and domains. I
- Branching processes of Petri nets
- A trace semantics for Petri nets
- An event structure semantics for general Petri nets
- PETRI NETS AND STEP TRANSITION SYSTEMS
- Partial (set) 2-structures. II: State spaces of concurrent systems
- Sequential and concurrent behaviour in Petri net theory
- Petri nets are monoids
- Elementary transition systems
- Event structures and domains
- Petri nets, algebras, morphisms, and compositionality
Cited In (18)
- Functorial models for Petri nets
- Testing equivalences of time Petri nets
- Title not available (Why is that?)
- Semantic domains of timed event structures
- Safety, Liveness and Run-Time Refinement for Modular Process-Aware Information Systems with Dynamic Sub Processes
- How Much Is Worth to Remember? A Taxonomy Based on Petri Nets Unfoldings
- Configuration structures, event structures and Petri nets
- Synthesis of nets with inhibitor arcs
- Comparative trace semantics of time Petri nets
- An event structure semantics for general Petri nets
- On the join dependency relation in multinomial lattices
- Replication, refinement \& reachability: complexity in dynamic condition-response graphs
- Topological properties of event structures
- Process versus unfolding semantics for Place/Transition Petri nets
- Comparative Transition System Semantics for Cause-Respecting Reversible Prime Event Structures
- Domain and event structure semantics for Petri nets with read and inhibitor arcs
- Branching Processes of General Petri Nets
- A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
This page was built for publication: An event structure semantics for general Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672871)
