scientific article

zbMath0595.68024MaRDI QIDQ3727367

Jan Willem Klop, Jan A. Bergstra

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

alternating bit protocolAlgebra of Communicating Processesfair abstraction rule

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items

Process algebra with guards: Combining hoare logic with process algebra, On sequential composition, action prefixes and process prefix, Linearization of hybrid processes, On the consistency of Koomen's fair abstraction rule, Discrete time process algebra with abstraction, Formalizing process algebraic verifications in the calculus of constructions, Full abstraction and recursion, Fair testing, Axiomatizations for the perpetual loop in process algebra, SOS formats and meta-theory: 20 years after, Formal modeling of evolving self-adaptive systems, A compositional protocol verification using relativized bisimulation, An algebraic verification of a mobile network, Ensuring liveness properties of distributed systems: open problems, Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic?, Process algebra for hybrid systems, An axiomatic semantics for Esterel, Fixed points in free process algebras. I, A theory of stochastic systems. II: Process algebra, CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions, A Generic Process Algebra