scientific article
From MaRDI portal
Publication:3795192
zbMath0649.68015MaRDI QIDQ3795192
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
concurrencynondeterminismPartial order semanticsfinite Petri netsnet semanticsCCS programequivalence notionslabelled P/T-systems
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of operating systems (68N25)
Related Items (20)
Compositional process semantics of Petri Boxes ⋮ Language Representability of Finite P/T Nets ⋮ Concurrent bisimulations in Petri nets ⋮ Nested-Unit Petri Nets: A Structural Means to Increase Efficiency and Scalability of Verification on Elementary Nets ⋮ An algebraic semantics for hierarchical P/T nets ⋮ Functional equivalences of Petri nets ⋮ Causality and true concurrency: A data-flow analysis of the Pi-Calculus ⋮ Nested-unit Petri nets ⋮ Some behavioural aspects of net theory ⋮ Branching processes of Petri nets ⋮ A multiset semantics for the pi-calculus with replication ⋮ 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 ⋮ Effective Representation of RT-LOTOS Terms by Finite Time Petri Nets ⋮ Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS ⋮ Failures semantics based on interval semiwords is a congruence for refinement ⋮ 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
This page was built for publication:
