Unique decomposition of processes

DOI10.1016/0304-3975(93)90176-TzbMath0777.68037OpenAlexW2132282999WikidataQ59557021 ScholiaQ59557021MaRDI QIDQ1208422

Faron Moller, Arthur J. Milner

Publication date: 16 May 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90176-t

zbMATH Keywords

decompositionbisimulationtrace equivalencefailure equivalence

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?, A polynomial algorithm for deciding bisimilarity of normed context-free processes, Timing and causality in process algebra, HOCore in Coq, How to Parallelize sequential processes, Compositional learning for interleaving parallel automata, Infinite results, Unique parallel decomposition in branching and weak bisimulation semantics, On the existence and decidability of unique decompositions of processes in the applied \(\pi\)-calculus, On the expressiveness and decidability of higher-order process calculi, Unnamed Item, Unnamed Item, Team bisimilarity, and its associated modal logic, for BPP nets, CCS with Hennessy's merge has no finite-equational axiomatization, Pushdown automata, multiset automata, and Petri nets, Decomposition orders -- another generalisation of the fundamental theorem of arithmetic, A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes, Effective decomposability of sequential behaviours

Cites Work

• Testing equivalences for processes
• A Theory of Communicating Sequential Processes
• Unnamed Item
• Unnamed Item
• Unnamed Item