Sequential and concurrent behaviour in Petri net theory

DOI10.1016/0304-3975(87)90090-9zbMath0669.68043OpenAlexW2022479543MaRDI QIDQ1119024

Publication date: 1987

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90090-9

zbMATH Keywords

concurrent systems Petri nets CSP concurrency partial orders synchronisation CCS behaviour of systems COSY interleaved processes

Mathematics Subject Classification ID

Partial orders, general (06A06) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) General systems (93A10) Information theory (general) (94A15)

Related Items

Compositional process semantics of Petri Boxes ⋮ Configuration structures, event structures and Petri nets ⋮ Axiomatizing Petri net concatenable processes ⋮ Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence) ⋮ Concurrent bisimulations in Petri nets ⋮ A Petri net model for membrane systems with dynamic structure ⋮ Process semantics of general inhibitor nets ⋮ Reversible computation in nets with bonds ⋮ Verification of finite-state machines: a distributed approach ⋮ Causal behaviours and nets ⋮ Timed processes of Timed Petri Nets ⋮ On the category of Petri net computations ⋮ Twenty years of rewriting logic ⋮ A Study on Team Bisimulations for BPP Nets ⋮ Rewriting logic as a semantic framework for concurrency: a progress report ⋮ Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets ⋮ On Interval Semantics of Inhibitor and Activator Nets ⋮ Localities in systems with a/sync communication ⋮ Petri boxes and finite precedence ⋮ Exploiting step semantics for efficient bounded model checking of asynchronous systems ⋮ Partial order behaviour and structure of Petri nets ⋮ Failures: Their Definition, Modelling and Analysis ⋮ Some behavioural aspects of net theory ⋮ Algebraic structures of directed acyclic graphs: application to concurrent calculus ⋮ Team equivalences for finite-state machines with silent moves ⋮ Petri nets are monoids ⋮ Unnamed Item ⋮ Control machines: A new model of parallelism for compositional specifications and their effective compilation ⋮ Planning as satisfiability: parallel plans and algorithms for plan search ⋮ Team bisimilarity, and its associated modal logic, for BPP nets ⋮ A compositional Petri net translation of general \(\pi\)-calculus terms ⋮ Executions: A new partial-order semantics of Petri nets ⋮ An axiomatization of the algebra of Petri net concatenable processes ⋮ An event structure semantics for general Petri nets ⋮ Process versus unfolding semantics for Place/Transition Petri nets ⋮ On the implementation of concurrent calculi in net calculi: two case studies ⋮ Petri net semantics of priority systems ⋮ Branching Processes of General Petri Nets ⋮ The Mutex Paradigm of Concurrency ⋮ Interval semantics for Petri nets with inhibitor arcs ⋮ Processes of membrane systems with promoters and inhibitors ⋮ An algebraic semantics for structured transition systems and its application to logic programs ⋮ Causal Semantics for BPP Nets with Silent Moves ⋮ Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework ⋮ Unifying Petri Nets with Restricted Occurrence Rule Using Partial Algebra ⋮ A trace semantics for Petri Nets ⋮ M-nets: a survey ⋮ Abstract processes and conflicts in place/transition systems ⋮ A study on team bisimulation and H-team bisimulation for BPP nets ⋮ On Causal Semantics of Petri Nets ⋮ Unifying Petri Net Semantics with Token Flows ⋮ Failures semantics based on interval semiwords is a congruence for refinement ⋮ Operational and denotational semantics for the box algebra ⋮ On the Analysis of Petri Nets and their Synthesis from Process Languages ⋮ An algebraic characterization of independence of Petri net processes ⋮ Using transition set sequences to partition behaviors of Petri nets ⋮ A causal semantic for time Petri nets ⋮ Functorial models for Petri nets ⋮ The box algebra = Petri nets + process expressions ⋮ An abstract machine for concurrent modular systems: CHARM ⋮ An extension of Kleene's and Ochmański's theorems to infinite traces ⋮ Pomset bisimulation and unfolding for reset Petri nets

Cites Work