The algebra of communicating processes with empty process
From MaRDI portal
Publication:1391788
DOI10.1016/S0304-3975(96)00250-2zbMath0901.68112MaRDI QIDQ1391788
Publication date: 23 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Axiomatizing GSOS with termination ⋮ Rule formats for compositional non-interference properties ⋮ On the consistency of Koomen's fair abstraction rule ⋮ Duplication of constants in process algebra ⋮ Nonaxiomatisability of equivalences over finite state processes ⋮ A process calculus with finitary comprehended terms ⋮ A general conservative extension theorem in process algebras with inequalities ⋮ Revisiting sequential composition in process calculi ⋮ On the axiomatisability of priority. III: Priority strikes again ⋮ Expressiveness modulo bisimilarity of regular expressions with parallel composition ⋮ Unnamed Item ⋮ A ground-complete axiomatization of stateless bisimilarity over Linda ⋮ Rooted branching bisimulation as a congruence ⋮ Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity ⋮ Structured operational semantics and bisimulation as a congruence ⋮ Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination ⋮ The free process algebra generated by \(\delta \), \(\epsilon\) and \(\tau \) ⋮ Decomposition orders -- another generalisation of the fundamental theorem of arithmetic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebra of communicating processes with abstraction
- On the consistency of Koomen's fair abstraction rule
- Global renaming operators in concrete process algebra
- Process algebra with guards: Combining hoare logic with process algebra
- Process algebra for synchronous communication
- A Theory of Communicating Sequential Processes
- Process Algebra
This page was built for publication: The algebra of communicating processes with empty process
