scientific article; zbMATH DE number 177854

MaRDI QIDQ4038732zbMATH OpenFDO

Authors Faron Moller

Publication date 18 May 1993

zbMATH Keywords

combinators for concurrent executionequational axiomatisationsequational theoryleft merge operatorprocess algebra

Mathematics Subject Classification ID

Equational classes, universal algebra in model theory (03C05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 4037177
• scientific article; zbMATH DE number 937812
• scientific article; zbMATH DE number 139606
• Communicating Sequential Processes. The First 25 Years
• An algorithm for direct construction of complete merged processes
• Process Algebra: An Algebraic Theory of Concurrency
• Priority and abstraction in process algebra
• Merged processes: a new condensed representation of Petri net behaviour
• scientific article; zbMATH DE number 7319030
• CONCUR 2005 – Concurrency Theory

Cited in

(27)

• The semantics of the combination of atomized statements and parallel choice
• An axiomatic semantics for the synchronous language Gentzen.
• Finite axiom systems for testing preorder and De Simone process languages
• Rule formats for distributivity
• CCS with Hennessy's merge has no finite-equational axiomatization
• Decomposition orders -- another generalisation of the fundamental theorem of arithmetic
• On the axiomatisability of priority. III: Priority strikes again
• A Context-Free Process as a Pushdown Automaton
• scientific article; zbMATH DE number 4037177 (Why is no real title available?)
• The fork calculus
• A ground-complete axiomatization of stateless bisimilarity over Linda
• Unique parallel decomposition for the \(\pi\)-calculus
• scientific article; zbMATH DE number 7471704 (Why is no real title available?)
• Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?
• scientific article; zbMATH DE number 7559474 (Why is no real title available?)
• A basic parallel process as a parallel pushdown automaton
• The quest for equational axiomatizations of parallel composition: status and open problems
• An axiomatic semantics for Esterel
• Nested semantics over finite trees are equationally hard
• Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction
• Structural operational semantics for weak bisimulations
• Are two binary operators necessary to finitely axiomatise parallel composition?
• Non finite axiomatisability of weak bisimulation-based congruences
• Axiomatising weak bisimulation congruences over CCS with left merge and communication merge
• Bisimilarity is not finitely based over BPA with interrupt
• Unique parallel decomposition in branching and weak bisimulation semantics
• Lifting non-finite axiomatizability results to extensions of process algebras

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4038732)