On the consistency of Koomen's fair abstraction rule
From MaRDI portal
Publication:1090103
DOI10.1016/0304-3975(87)90052-1zbMath0621.68010OpenAlexW2106934908MaRDI QIDQ1090103
Jan Willem Klop, Jos C. M. Baeten, Jan A. Bergstra
Publication date: 1987
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/1704
process algebraconcurrencyalgebra of communicating processesApproximation Induction Principlegraph model for ACPRecursive Definition \& Specification Principles
Related Items (43)
Modal logic and the approximation induction principle ⋮ Recursion induction for real-time processes ⋮ Computable processes and bisimulation equivalence ⋮ Branching time and orthogonal bisimulation equivalence ⋮ Real time process algebra ⋮ Cones and foci: A mechanical framework for protocol verification ⋮ Global renaming operators in concrete process algebra ⋮ Preferential choice and coordination conditions ⋮ Unnamed Item ⋮ Congruence from the operator's point of view. Syntactic requirements on modal characterizations ⋮ Reactive Turing machines ⋮ The algebra of communicating processes with empty process ⋮ Axiomatizing flat iteration ⋮ An algebra of behavioural types ⋮ Reconciling real and stochastic time: the need for probabilistic refinement ⋮ Quantum process algebra with priorities ⋮ Issues in the design of a parallel object-oriented language ⋮ Command algebras, recursion and program transformation ⋮ Replacement freeness: a criterion for separating process calculi ⋮ A Context-Free Process as a Pushdown Automaton ⋮ Processes and formalisms for unbounded choice ⋮ Turing Machines, Transition Systems, and Interaction ⋮ Deciding probabilistic bisimilarity over infinite-state probabilistic systems ⋮ Non-deterministic structures of computation ⋮ Unguardedness mostly means many solutions ⋮ An axiomatization for quantum processes to unifying quantum and classical computing ⋮ Turing machines, transition systems, and interaction ⋮ Ensuring liveness properties of distributed systems: open problems ⋮ Splitting bisimulations and retrospective conditions ⋮ Fixed point equations with parameters in the projective model ⋮ An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation ⋮ Non-regular iterators in process algebra ⋮ Modular specification of process algebras ⋮ A complete axiomatisation for observational congruence of finite-state behaviours ⋮ Reactive Turing Machines ⋮ Context-free event domains are recognizable ⋮ Context-free event domains are recognizable ⋮ Extending Timed Process Algebra with Discrete Stochastic Time ⋮ CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions ⋮ On Specifying Timeouts ⋮ Parallel Processes with Implicit Computational Capital ⋮ Expressiveness of Process Algebras ⋮ Equivalence of recursive specifications in process algebra
Cites Work
- Fixed point equations with parameters in the projective model
- A fair calculus of communicating systems
- Axiomatising finite delay operators
- Algebra of communicating processes with abstraction
- Merging regular processes by means of fixed-point theory
- Top-down design and the algebra of communicating processes
- A calculus of communicating systems
- The algebra of communicating processes with empty process
- Algebraic specification and verification of communication protocols
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the consistency of Koomen's fair abstraction rule
