Readies and Failures in the Algebra of Communicating Processes

DOI10.1137/0217073zbMath0677.68089OpenAlexW2109805557MaRDI QIDQ3833645

Jan Willem Klop, Jan A. Bergstra, Ernst-Ruediger Olderog

Publication date: 1988

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/23489

zbMATH Keywords

process algebraconcurrencyreadiness semanticsfailure semanticsbisimulation semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Related Items

Global renaming operators in concrete process algebra, Full abstraction and recursion, A fully abstract model for the exchange of information in multi-agent systems., Unnamed Item, Algebraic and fixed point equations over inverse limits of algebras, On deciding some equivalences for concurrent processes, Towards general axiomatizations for bisimilarity and trace semantics, Petri net semantics of priority systems, Structured operational semantics and bisimulation as a congruence, Specification-oriented semantics for communicating processes, On deciding trace equivalences for processes