scientific article; zbMATH DE number 3990852

From MaRDI portal
Publication:3753475





[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.




Cited in
(28)








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)