scientific article

Frits W. Vaandrager, Robert J. van Glabbeek

Publication date: 1987

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

Petri nets bisimulation equivalence algebra of communicating processes True concurrency concurrent bisimulation equivalence occurrence net equivalence partial order equivalences real-time consistency

Mathematics Subject Classification ID

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

Related Items

Compositional process semantics of Petri Boxes, Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP, Operational semantics for Petri net components, Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence), Concurrent bisimulations in Petri nets, Real time process algebra, Concurrent testing of processes, Deciding true concurrency equivalences on safe, finite nets, The difference between splitting in \(n\) and \(n+1\), Architectural CCS, Concurrency and atomicity, Nested-Unit Petri Nets: A Structural Means to Increase Efficiency and Scalability of Verification on Elementary Nets, Timing and causality in process algebra, Towards a complete hierarchy of compositional dataflow models, An algebraic semantics for hierarchical P/T nets, Causal behaviours and nets, Causality and true concurrency: A data-flow analysis of the Pi-Calculus, Characterising spectra of equivalences for event structures, logically, Generating Posets Beyond N, A Study on Team Bisimulations for BPP Nets, Modelling mutual exclusion in a process algebra with time-outs, Just testing, Nested-unit Petri nets, On relating concurrency and nondeterminism, Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra, On Interval Semantics of Inhibitor and Activator Nets, Foundational aspects of multiscale modeling of biological systems with process algebras, Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction, Better automata through process algebra, Untanglings: a novel approach to analyzing concurrent systems, A partial ordering semantics for CCS, On hierarchically developing reactive systems, Team equivalences for finite-state machines with silent moves, Petri nets are monoids, Branching processes of Petri nets, Deciding true concurrency equivalences on finite safe nets (preliminary report), Team bisimilarity, and its associated modal logic, for BPP nets, Locality and interleaving semantics in calculi for mobile processes, Process versus unfolding semantics for Place/Transition Petri nets, A theory of processes with durational actions, Interval semantics for Petri nets with inhibitor arcs, Modeling concurrency with interval traces, Structure of concurrency, Bisimulation and action refinement, Universal axioms for bisimulations, Structured operational semantics and bisimulation as a congruence, Towards an algebra for timed behaviours, Refinement of actions in event structures and causal trees, Truly concurrent constraint programming, Ensuring liveness properties of distributed systems: open problems, Quantales, finite observations and strong bisimulation, On the expressiveness of higher dimensional automata, Models and logics for true concurrency., On the semantics of durational actions, Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS, A study on team bisimulation and H-team bisimulation for BPP nets, Failures semantics based on interval semiwords is a congruence for refinement, On performance congruences for process algebras, Bio-PEPAd: a non-Markovian extension of Bio-PEPA, Algebraic Structure of Step Traces and Interval Traces, Constructing weak simulations from linear implications for processes with private names, Towards a unified view of bisimulation: A comparative study, Processes of timed Petri nets, A theory of stochastic systems. I: Stochastic automata, CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions, Zero-safe nets: Comparing the collective and individual token approaches., Vertical implementation, The box algebra = Petri nets + process expressions, Extensions of Standard Weak Bisimulation Machinery: Finite-state General Processes, Refinable Actions, Maximal-progress and Time, The theory of interactive generalized semi-Markov processes, Truly concurrent constraint programming, Pomset bisimulation and unfolding for reset Petri nets, Partial order semantics and read arcs