On the Consistency of Koomen's Fair Abstraction Rule

@article{Baeten1987OnTC,
  title={On the Consistency of Koomen's Fair Abstraction Rule},
  author={J. Baeten and J. Bergstra and J. Klop},
  journal={Theor. Comput. Sci.},
  year={1987},
  volume={51},
  pages={129-176}
}
Abstract We construct a graph model for ACP τ , the algebra of communicating processes with silent steps, in which Koomen's Fair Abstraction Rule (KFAR) holds, and also versions of the Approximation Induction Principle (AIP) and the Recursive Definition & Specification Principles (RDP&RSP). We use this model to prove that in ACP T (but not in ACP!) each computably recursively definable process is finitely recursively definable. 
Another Look at Abstraction in Process Algebra (Extended Abstract)
TLDR
A hidden step η is introduced, and a model for the resulting theory ACPη is constructed, which briefly looks at recursive specifications in this theory, and discusses the relations with Milner's silent step τ. Expand
Bounded Nondeterminism and the Approximation Induction Principle in Process Algebra
TLDR
A new semantics of ACPτ, the Algebra of Communicating Processes with abstraction is presented which is isomorphic to the model of process graphs modulo rooted τδ-bisimulation of Baeten, Bergstra & Klop. Expand
Process theory based on bisimulation semantics
TLDR
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence and inference systems which are complete for proving the equivalence of regular (finite state) processes are discussed. Expand
ACTtau: A Universal Axiom System for Process Specification
TLDR
The Finite Specification Theorem is stated, stating that each finitely branching, effectively presented process can be specified in ACPτ by means of a finite system of guarded recursion equations. Expand
Another look at abstraction in process algebra
TLDR
A hidden step rl is introduced, and a model for the resulting theory ACP is constructed, which briefly looks at recursive specifications in this theory, and discusses the relations with Milner's silent step X. Expand
On Modal Characterizations and Turning GSOS Rules Into Equations
In this thesis properties of various process equivalences are analysed, specifically definability with finite HML formulas, soundness of the Approximation Induction Principle and properties ofExpand
On the Expressiveness of ACP
De Simone showed that a wide class of languages, including CCS, SCCS, CSP and ACP, are expressible up to strong bisimulation equivalence in Meije. He also showed that every recursively enumerableExpand
A Complete Axiomatisation for Observational Congruence of Finite-State Behaviors
  • R. Milner
  • Computer Science, Mathematics
  • Inf. Comput.
  • 1989
TLDR
A complete axiomatisation for this congruence relation based upon the notion of weak bisimulation or observational equivalence due to Park and Milner is presented. Expand
A Note on Expressiveness of Process Algebra
  • I. Phillips
  • Mathematics, Computer Science
  • Theory and Formal Methods
  • 1993
We extend the work of Baeten, Bergstra & Klop by showing that every recursively enumerable transition system can be expressed in process algebra up to weak bisimulation.
Verification of random behaviours
We introduce abstraction in a probabilistic process algebra. The process algebra can be employed for specifying processes that exhibit both prob- abilistic and non-deterministic choices in theirExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 23 REFERENCES
A complete inference system for rgular processes with silent moves
TLDR
The notion of bisimulation between process graphs with silent or invisible steps leads to a normalisation or minimalisation result for regular processes with τ-steps and subject to operations +, ·, and ∥, thereby answering a question of MTLNER and proving the consistency of Koomen's fair abstraction rule. Expand
Algebra of Communicating Processes with Abstraction
TLDR
The system is an extension of ACP, Algebra of Communicating Processes, with Milner's τ-laws and an explicit abstraction operator, and syntactic properties such as consistency and conservativity over ACP are proved. Expand
Another Look at Abstraction in Process Algebra (Extended Abstract)
TLDR
A hidden step η is introduced, and a model for the resulting theory ACPη is constructed, which briefly looks at recursive specifications in this theory, and discusses the relations with Milner's silent step τ. Expand
Bounded Nondeterminism and the Approximation Induction Principle in Process Algebra
TLDR
A new semantics of ACPτ, the Algebra of Communicating Processes with abstraction is presented which is isomorphic to the model of process graphs modulo rooted τδ-bisimulation of Baeten, Bergstra & Klop. Expand
Conditional axioms and α/β-calculus in process algebra
TLDR
This work starts with axioms describing a class of models for concurrency and indicates a growing interest in an algebraic treatment of concurrency. Expand
Abstraction and empty process in process algebra
TLDR
Formulates a system ACPc, which is a conservative extension of the systems ACP/sub eta /, ACP square root, but also of ACP /sub tau /, in which most relevant issues can be discussed. Expand
An Algebraic Theory of Fair Asynchronous Communicating Processes
TLDR
A language for defining fair asynchronous communicating processes that satisfies a large collection of equations which supports a transformational proof system for processes and it is shown that no fully-abstract model can be continuous. Expand
Processes and a Fair Semantics for the Ada Rendez-Vous
TLDR
It is discussed how such processes can be used to assign meanings to languages with concurrency, culminating in a definition of the ADA rendez-vous. Expand
Concurrency and Automata on Infinite Sequences
  • D. Park
  • Computer Science
  • Theoretical Computer Science
  • 1981
TLDR
A general method for proving/deciding equivalences between omega-regular languages, whose recognizers are modified forms of Buchi or Muller-McNaughton automata, derived from Milner's notion of “simulation” is obtained. Expand
A Calculus of Communicating Systems
  • R. Milner
  • Mathematics, Computer Science
  • Lecture Notes in Computer Science
  • 1980
TLDR
A case study in synchronization and proof techniques, and some proofs about data structures in value-communication as a model of CCS 2.0. Expand
...
1
2
3
...