scientific article

zbMath0656.68005MaRDI QIDQ4040147

Cèsar Fernández, Eike Best

Publication date: 5 June 1993

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

zbMATH Keywords

concurrent systemsPetri netsinterleaving semanticspartially ordered setsexercisesprocessescommented bibliographyoccurrence netsformal theory of parallel systems

Mathematics Subject Classification ID

Partial orders, general (06A06) Formal languages and automata (68Q45) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Theory of operating systems (68N25)

Related Items (36)

Concurrency-Preserving Minimal Process Representation ⋮ Mutex needs fairness ⋮ A Petri net model for membrane systems with dynamic structure ⋮ Process semantics of general inhibitor nets ⋮ Abstract fairness and semantics ⋮ Algebraic characterization of petri net pomset semantics ⋮ The asynchronous committee meeting problem ⋮ Partial order behaviour and structure of Petri nets ⋮ Arc-typed Petri Nets ⋮ Complexity results for 1-safe nets ⋮ Trapping mutual exclusion in the box calculus ⋮ Elementary transition systems ⋮ Solving recursive net equations ⋮ Processes of membrane systems with promoters and inhibitors ⋮ Petri games: synthesis of distributed systems with causal memory ⋮ Bisimulation and action refinement ⋮ Inheritance of behavior ⋮ Model checking using net unfoldings ⋮ Time processes for time Petri nets ⋮ Petri's axioms of concurrency a selection of recent results ⋮ A compositional partial order semantics for Petri net components ⋮ Flexibility in Algebraic Nets ⋮ ESTL: A Temporal Logic for Events and States ⋮ Petri net reactive modules ⋮ Algebraic nets with flexible arcs ⋮ A trace semantics for Petri Nets ⋮ Combining free choice and time in Petri nets ⋮ M-nets: a survey ⋮ Orthomodular Lattices in Occurrence Nets ⋮ Operational and denotational semantics for the box algebra ⋮ A uniform approach to true-concurrency and interleaving semantics for Petri nets ⋮ On the Analysis of Petri Nets and their Synthesis from Process Languages ⋮ A rigorous methodology for specification and verification of business processes ⋮ Process languages and nets ⋮ A causal semantic for time Petri nets ⋮ Finite Petri nets as models for recursive causal behaviour

This page was built for publication: