DMCA
Saturated semantics for reactive systems (2006)
| Venue: | LOGIC IN COMPUTER SCIENCE |
| Citations: | 36 - 18 self |
BibTeX
@INPROCEEDINGS{Bonchi06saturatedsemantics,
author = {Filippo Bonchi and Barbara König and Ugo Montanari},
title = { Saturated semantics for reactive systems},
booktitle = { LOGIC IN COMPUTER SCIENCE },
year = {2006},
pages = {69--80},
publisher = {IEEE}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The semantics of process calculi has traditionally been specified by labelled transition systems (LTS), but with the development of name calculi it turned out that reaction rules (i.e., unlabelled transition rules) are often more natural. This leads to the question of how behavioural equivalences (bisimilarity, trace equivalence, etc.) defined for LTS can be transferred to unlabelled transition systems. Recently, in order to answer this question, several proposals have been made with the aim of automatically deriving an LTS from reaction rules in such a way that the resulting equivalences are congruences. Furthermore these equivalences should agree with the intended semantics, whenever one exists. In this paper we propose saturated semantics, based on a weaker notion of observation and orthogonal to all the previous proposals, and we demonstrate the appropriateness of our semantics by means of two examples: logic programming and a subset of the open π-calculus. Indeed, we prove that our equivalences are congruences and that they coincide with logical equivalence and open bisimilarity respectively, while equivalences studied in previous works are strictly finer.
Keyphrases
reactive system reaction rule behavioural equivalence unlabelled transition rule resulting equivalence saturated semantics process calculus previous proposal several proposal unlabelled transition system open bisimilarity trace equivalence labelled transition system logic programming previous work logical equivalence open calculus intended semantics name calculus
