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
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
Communication and Concurrency
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
From Rewrite to Bisimulation Congruences
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Deriving Bisimulation Congruences for Reactive Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
On Bisimulations for the Asynchronous pi-Calculus
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Compositional semantics for open Petri nets based on deterministic processes
Mathematical Structures in Computer Science
Saturated Semantics for Reactive Systems
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Theoretical Computer Science - Mathematical foundations of computer science 2000
CC-Pi: a constraint-based language for specifying service level agreements
ESOP'07 Proceedings of the 16th European conference on Programming
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Process bisimulation via a graphical encoding
ICGT'06 Proceedings of the Third international conference on Graph Transformations
| Hi-index | 0.00 |
The operational behavior of interactive systems is usually given in terms of transition systems labeled with actions, which, when visible, represent both observations and interactions with the external world. The abstract semantics is given in terms of behavioral equivalences, which depend on the action labels and on the amount of branching structure considered. Behavioural equivalences are often congruences with respect to the operations of the language, and this property expresses the compositionality of the abstract semantics.