Declarative modeling of the operational behavior of logic languages
Theoretical Computer Science
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 calculus of mobile processes, I
Information and Computation
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution
Theoretical Computer Science
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
A Coalgebraic presentation of structured transition systems
Theoretical Computer Science
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
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
On Bisimulations for the Asynchronous pi-Calculus
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
A Compositional Partial Order Semantics for Petri Net Components
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
A fully abstract model for the π-calculus
Information and Computation
A Fully Abstract Domain Model for the p-Calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Semantics of Name and Value Passing
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Compositional semantics for open Petri nets based on deterministic processes
Mathematical Structures in Computer Science
Deriving weak bisimulation congruences from reduction systems
CONCUR 2005 - Concurrency Theory
Behavioral theory for mobile ambients
Journal of the ACM (JACM)
Pure bigraphs: structure and dynamics
Information and Computation
Saturated Semantics for Reactive Systems
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Transition systems, link graphs and Petri nets
Mathematical Structures in Computer Science
Theoretical Computer Science - Mathematical foundations of computer science 2000
Locating reaction with 2-categories
Theoretical Computer Science - Foundations of software science and computation structures
Local Bigraphs and Confluence: Two Conjectures
Electronic Notes in Theoretical Computer Science (ENTCS)
Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding)
Electronic Notes in Theoretical Computer Science (ENTCS)
Relationally Staged Computations in Calculi of Mobile Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
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
A unifying model of variables and names
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Labels from reductions: towards a general theory
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Process bisimulation via a graphical encoding
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Coalgebraic models for reactive systems
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Reactive systems over directed bigraphs
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Coalgebraic semantics for parallel derivation strategies in logic programming
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Coalgebraic semantics for derivations in logic programming
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Exploiting Parallelism in Coalgebraic Logic Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 5.23 |
The semantics of process calculi has traditionally been specified by labelled transition systems (ltss), 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 behavioral 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 open Petri nets. We also show that saturated semantics can be efficiently characterized through the so called semi-saturated games. Finally, we provide coalgebraic models relying on presheaves.