Selected papers of the Second Workshop on Concurrency and compositionality
Dynamic congruence vs. progressing bisimulation for CCS
Fundamenta Informaticae - Special issue on mathematical foundations of computer science '91
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
From rewrite rules to bisimulation congruences
Theoretical Computer Science
A Calculus of Communicating Systems
A Calculus of Communicating Systems
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Deriving bisimulation congruences using 2-categories
Nordic Journal of Computing
Saturated Semantics for Reactive Systems
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Locating reaction with 2-categories
Theoretical Computer Science - Foundations of software science and computation structures
Encoding Asynchronous Interactions Using Open Petri Nets
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Deriving structural labelled transitions for mobile ambients
Information and Computation
On the semantics of Markov automata
Information and Computation
| Hi-index | 0.00 |
Behavioural equivalences of various calculi for modelling distributed systems differ significantly because the properties which can be observed through interaction depend heavily upon their mode of communication. A typical approach to describing the semantics of communicating processes is to provide a labelled transition system (lts) which captures the interaction potential of the individual processes within a larger system. In many cases, a natural rendering of this lts leads to too fine a semantics as unobservability of certain communications is not accounted for. We propose that a standard approach to augmenting ltss allows morally unobservable communications to actually be modelled as unobservables in the semantics. This approach derives from a rule initially given by Honda and Tokoro to account for unobservability of reception in the asynchronous @p-calculus. We examine the implications of adding such rules to lts with respect to the proving behavioural equivalences for various synchronisation mechanisms.