@inproceedings{a16ebf4f8afd4e66bf15f2603b0793f3,
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 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 the forgetful refinement (i.e., when an action is refined into the properly terminated process) is dealt with in a new, improved manner.",
author = "N. Busi and {van Glabbeek}, R.J. and R. Gorrieri",
year = "1994",
month = jun,
day = "6",
doi = "10.5555/647320.721185",
language = "English",
isbn = "978-0-444-82020-4",
series = "IFIP Transactions A-56",
publisher = "North-Holland Publishing Company",
pages = "169--188",
editor = "Ernst-R{\"u}diger Olderog",
booktitle = "Programming Concepts, Methods and Calculi: Proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods, and Calculi (PROCOMET '94), San Miniato, Italy, 6-10 June 1994",
note = "Working Conference on Programming Concepts, Methods and Calculi, 1994, PROCOMET 1994 ; Conference date: 06-06-1994 Through 10-06-1994",
}