Paper Info
Title
Axiomatising ST-Bisimulation Equivalence
Abstract
A simple ST operational semantics for a process algebra is provided by defining a set of operational rules in Plotkin''s style. This algebra comprises TCSP parallel composition, ACP sequential composition and a refinement operator, which is used for replacing an action with an entire process, thus permitting a hierarchical specification of systems. We prove that ST bisimulation equivalence is a congruence, resorting to standard techniques on rule formats. Moreover, we provide a set of axioms that is sound and complete with respect to ST bisimulation. The intriguing case of forgetful refinement (i.e., when an action is refined to the properly terminated process) is dealt with in a new, improved manner.
Year
Venue
Keywords
1994
PROCOMET
process algebra,st bisimulation equivalence,axiomatising st bisimulation equivalence,refinement operator,operational rule,st bisimulation,tcsp parallel composition,forgetful refinement,simple st operational semantics,entire process,axiomatising st-bisimulation equivalence,acp sequential composition,operational semantics,concurrent programming
Field
DocType
Volume
Operational semantics,Algebra,Axiom,Computer science,Theoretical computer science,Equivalence (measure theory),Operator (computer programming),Bisimulation,Process calculus,Congruence (geometry),Bisimulation equivalence
Conference
56
ISSN
ISBN
Citations 
0926-5473
0-444-82020-5
11
PageRank 
References 
Authors
0.80
18
3
Name
Order
Citations
PageRank
Nadia Busi1103065.70
Rob J. van Glabbeek21930134.34
Roberto Gorrieri32297184.63