A trace semantics for Petri nets
From MaRDI portal
Publication:1891167
DOI10.1006/inco.1995.1032zbMath0826.68085OpenAlexW2023209100MaRDI QIDQ1891167
P. W. Hoogers, H. C. M. Kleijn, P. S. Thiagarajan
Publication date: 5 July 1995
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1995.1032
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)
Related Items
Distributed synthesis of asynchronously communicating distributed process models, Classifying invariant structures of step traces, A Symbolic Algorithm for the Synthesis of Bounded Petri Nets, Abstract processes of place/transition systems, Mind the gap: expanding communication options in decentralized discrete-event control, The word problem for \(1\mathcal{LC}\) congruences is NP-hard., An event structure semantics for general Petri nets, Relational structures for concurrent behaviours, Regions of Petri nets with a/sync connections, Applying regions, Step traces, A trace semantics for Petri Nets, Abstract processes and conflicts in place/transition systems, On Causal Semantics of Petri Nets, Pomset Languages of Finite Step Transition Systems, Abstract processes in the absence of conflicts in general place/transition systems
