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)
68Q55: Semantics in the theory of computing
Related Items
Duplication of constants in process algebra, On the consistency of Koomen's fair abstraction rule, Structured operational semantics and bisimulation as a congruence, Nonaxiomatisability of equivalences over finite state processes, A general conservative extension theorem in process algebras with inequalities, Decomposition orders -- another generalisation of the fundamental theorem of arithmetic, Axiomatizing GSOS with termination, Rule formats for compositional non-interference properties, Rooted branching bisimulation as a congruence
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