scientific article; zbMATH DE number 3990852
[For the entire collection see Zbl 0604.00016.] This paper presents a new semantics of \(ACP_{\tau}\), the Algebra of Communicating Processes with abstraction. This leads to a term model of \(ACP_{\tau}\) which is isomorphic to the model of process graphs modulo rooted \(\tau\delta\)-bisimulation, but in which no special rootedness condition is needed. Bisimilarity turns out to be a congruence in a natural way. In this model, the recursive definition principle (RDP), the commutativity of abstraction (CA) and Koomen's fair abstraction rule (KFAR) are satisfied, but the approximation induction principle (AIP) is not. The combination of these four principles is proven to be inconsistent, while any combination of three of them is not.
- Semantics and expressiveness of ordered SOS
- (Bi)simulations up-to characterise process semantics
- On the consistency of Koomen's fair abstraction rule
- Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
- Process expressions and Hoare's logic: Showing and irreconcilability of context-free recursion with Scott's induction rule
- Structured operational semantics and bisimulation as a congruence
- An algebra for process creation
- A nondeterministic extension over finitely recursive process model
- A general conservative extension theorem in process algebras with inequalities
- Language preorder as a precongruence
- Modular specification of process algebras
- Axiomatizing GSOS with termination
- A structural induction theorem for processes
- Rooted branching bisimulation as a congruence
- A unified rule format for bounded nondeterminism in SOS with terms as labels
- Thread algebra for strategic interleaving
- A syntactical approach to weak (bi-)simulation for coalgebras
- Simulations up-to and canonical preorders (extended abstract)
- Weak bisimulation as a congruence in MSOS
- scientific article; zbMATH DE number 4157899 (Why is no real title available?)
- Divide and congruence: from decomposition of modal formulas to preservation of branching and -bisimilarity
- Boundedness analysis of finitely recursive processes. I. Concurrent processes
- A ghost at _1
- Fixed point equations with parameters in the projective model
- An axiomatic semantics for Esterel
- Transition system specifications with negative premises
- Recursive process definitions with the state operator
- SOS formats and meta-theory: 20 years after
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753475)