scientific article; zbMATH DE number 1302042

zbMath0926.68082MaRDI QIDQ4247285

Grzegorz Rozenberg, Joost Engelfriet

Publication date: 16 June 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

elementary netlocal transitions

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (37)

Comparative trace semantics of time Petri nets ⋮ Modeling Distributed Private Key Generation by Composing Petri Nets ⋮ Step semantics of Boolean nets ⋮ Unnamed Item ⋮ Property-preserving transformations of elementary net systems based on morphisms ⋮ A Petri net model for membrane systems with dynamic structure ⋮ Confusion control in generalized Petri nets using synchronized events ⋮ Process semantics of general inhibitor nets ⋮ The true concurrency of differential interaction nets ⋮ On Interval Process Semantics of Petri Nets with Inhibitor Arcs ⋮ Automatic Decomposition of Petri Nets into Automata Networks – A Synthetic Account ⋮ On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets ⋮ Nested-unit Petri nets ⋮ On Interval Semantics of Inhibitor and Activator Nets ⋮ Localities in systems with a/sync communication ⋮ Failures: Their Definition, Modelling and Analysis ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the parameterized complexity of the synthesis of Boolean nets with restricted place environments ⋮ The Mutex Paradigm of Concurrency ⋮ Interval semantics for Petri nets with inhibitor arcs ⋮ Processes of membrane systems with promoters and inhibitors ⋮ Modeling concurrency with interval traces ⋮ Well-structuredness, safeness and soundness: a formal classification of BPMN collaborations ⋮ Relational structures for concurrent behaviours ⋮ Typed event structures and the linear \(\pi \)-calculus ⋮ Modeling Petri Nets by Local Action Systems1 1Partially supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems) and Esprit Working Group APPLIGRAPH through Universitaire Instelling Antwerpen. ⋮ Probabilistic event structures and domains ⋮ The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs ⋮ Step traces ⋮ Introducing time in reaction systems ⋮ Phase semantics and Petri net interpretation for resource-sensitive strong negation ⋮ The complexity of synthesizing elementary net systems relative to natural parameters ⋮ On Intransitive Non-interference in Some Models of Concurrency ⋮ On the Analysis of Petri Nets and their Synthesis from Process Languages ⋮ Algebraic Structure of Step Traces and Interval Traces ⋮ Confusion analysis and detection for workflow nets

This page was built for publication: