Deciding and Axiomatizing ST Bisimulation for a Process Algebra with Recursion and Action Refinement

Authors:
M. Bravetti;R. Gorrieri
Affiliations:
-;-
Venue:
Deciding and Axiomatizing ST Bisimulation for a Process Algebra with Recursion and Action Refinement
Year:
1999

Citing 0
Cited 3

Vertical implementation

Information and Computation
The theory of interactive generalized semi-Markov processes

Theoretical Computer Science
Foundational aspects of multiscale modeling of biological systems with process algebras

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose two techniques for expressing the ST semantics for terms of a process algebra. The first technique, which is more intuitive, is based on the idea of giving unique names to actions and allows to decide and axiomatize weak ST bisimulation for all processes that possess a finite state interleaving semantics. The second technique, which is based on pointers, allows to preserve the possibility of deciding and axiomatizing weak ST bisimulation when an action refinement operator $P[a \leadsto Q]$ is considered, i.e.\ $P[a \leadsto Q]$ is finite state whenever $P$ and $Q$ are finite state.