A calculus of mobile processes, II
Information and Computation
A &pgr;-calculus with explicit substitutions
MFCS '94 Selected papers from the 19th international symposium on Mathematical foundations of computer science
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Compositional SOS and beyond: a coalgebraic view of open systems
Theoretical Computer Science
pi-Calculus, Structured Coalgebras, and Minimal HD-Automata
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Nominal Logic: A First Order Theory of Names and Binding
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A New Approach to Abstract Syntax Involving Binders
LICS '99 Proceedings of the 14th 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
Structured coalgebras and minimal HD-automata for the π-calculus
Theoretical Computer Science - Mathematical foundations of computer science 2000
A Category of Explicit Fusions
Concurrency, Graphs and Models
Ugo Montanari and Software Verification
Concurrency, Graphs and Models
History Dependent Automata for Service Compatibility
Concurrency, Graphs and Models
Network Applications of Graph Bisimulation
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Bialgebraic methods and modal logic in structural operational semantics
Information and Computation
Modeling Fresh Names in the π-calculus Using Abstractions
Electronic Notes in Theoretical Computer Science (ENTCS)
Some Characterization Results for Permutation Algebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Weak bisimilarity coalgebraically
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Symmetries, local names and dynamic (de)-allocation of names
Information and Computation
Model checking for nominal calculi
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Hi-index | 0.00 |
In this paper, we propose a compositional coalgebraic semantics of the 驴-calculus based on a novel approach for lifting calculi with structural axioms to coalgebraic models. We equip the transition system of the calculus with permutations, parallel composition and restriction operations, thus obtaining a bialgebra. No prefix operation is introduced, relying instead on a clause format defining the transitions of recursively defined processes. The unique morphism to the final bialgebra induces a bisimilarity relation which coincides with observational equivalence and which is a congruence with respect to the operations. The permutation algebra is enriched with a name extrusion operator 驴 脿 la De Brujin, that shifts any name to the successor and generates a new name in the first variable x0. As a consequence, in the axioms and in the SOS rules there is no need to refer to the support, i.e., the set of significant names, and, thus, the model turns out to be first order.