Publication:3795192
From MaRDI portal
zbMath0649.68015MaRDI QIDQ3795192
Publication date: 1988
concurrency; nondeterminism; Partial order semantics; finite Petri nets; net semantics; CCS program; equivalence notions; labelled P/T-systems
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68N25: Theory of operating systems
Related Items
Solving recursive net equations, A translation of \(\text{TPAL}_{p}\) into a class of timed-probabilistic Petri nets, Step failures semantics and a complete proof system, A multiset semantics for the pi-calculus with replication, Failures semantics based on interval semiwords is a congruence for refinement, Some behavioural aspects of net theory, Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS, Branching processes of Petri nets, Operational and denotational semantics for the box algebra, A uniform approach to true-concurrency and interleaving semantics for Petri nets, Finite Petri nets as models for recursive causal behaviour, Nested-unit Petri nets, Concurrent bisimulations in Petri nets, Nested-Unit Petri Nets: A Structural Means to Increase Efficiency and Scalability of Verification on Elementary Nets, Language Representability of Finite P/T Nets, Effective Representation of RT-LOTOS Terms by Finite Time Petri Nets
