A semantic framework for open processes
Theoretical Computer Science
Compositional Specification of Web Services Via Behavioural Equivalence of Nets: A Case Study
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Models of Computation: A Tribute to Ugo Montanari's Vision
Concurrency, Graphs and Models
A Category of Explicit Fusions
Concurrency, Graphs and Models
Network Applications of Graph Bisimulation
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Abstract Semantics by Observable Contexts
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
G-Reactive Systems as Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Synthesising CCS bisimulation using graph rewriting
Information and Computation
On the Use of Behavioural Equivalences for Web Services' Development
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
A Coalgebraic Theory of Reactive Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Reactive Systems, Barbed Semantics, and the Mobile Ambients
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding)
Electronic Notes in Theoretical Computer Science (ENTCS)
Making the Unobservable, Unobservable
Electronic Notes in Theoretical Computer Science (ENTCS)
Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
Theoretical Computer Science
Deriving bisimulation congruences with borrowed contexts
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
A behavioural congruence for web services
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
SENSORIA process calculi for service-oriented computing
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
RPO, second-order contexts, and λ-calculus
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Deriving bisimulation congruences in the presence of negative application conditions
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Efficient bisimilarities from second-order reaction semantics for π-calculus
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Saturated LTSs for adhesive rewriting systems
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Deriving labels and bisimilarity for concurrent constraint programming
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Partition refinement for bisimilarity in CCP
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Deriving bisimulation congruences for conditional reactive systems
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
A Presheaf Environment for the Explicit Fusion Calculus
Journal of Automated Reasoning
On the Use of Behavioural Equivalences for Web Services' Development
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
Coalgebraic models for reactive systems
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Efficient computation of program equivalence for confluent concurrent constraint programming
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Hi-index | 0.00 |
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 standard 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.