scientific article
From MaRDI portal
Publication:4038732
zbMath0774.68039MaRDI QIDQ4038732
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
process algebraequational theorycombinators for concurrent executionequational axiomatisationsleft merge operator
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Equational classes, universal algebra in model theory (03C05)
Related Items
Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? ⋮ Bisimilarity is not finitely based over BPA with interrupt ⋮ Nested semantics over finite trees are equationally hard ⋮ Unique parallel decomposition in branching and weak bisimulation semantics ⋮ On the axiomatisability of priority. III: Priority strikes again ⋮ An axiomatic semantics for the synchronous language Gentzen. ⋮ Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Context-Free Process as a Pushdown Automaton ⋮ A ground-complete axiomatization of stateless bisimilarity over Linda ⋮ The fork calculus ⋮ Structural operational semantics for weak bisimulations ⋮ Rule formats for distributivity ⋮ A Basic Parallel Process as a Parallel Pushdown Automaton ⋮ CCS with Hennessy's merge has no finite-equational axiomatization ⋮ Lifting non-finite axiomatizability results to extensions of process algebras ⋮ Unnamed Item ⋮ Decomposition orders -- another generalisation of the fundamental theorem of arithmetic ⋮ An axiomatic semantics for Esterel ⋮ The semantics of the combination of atomized statements and parallel choice ⋮ Finite axiom systems for testing preorder and De Simone process languages ⋮ The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems
