A calculus of mobile processes, II
Information and Computation
Information and Computation
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
History dependent verification for partial order systems
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
A typed language for distributed mobile processes (extended abstract)
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
A calculus for cryptographic protocols
Information and Computation
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
Efficient Minimization up to Location Equivalence
ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
An Automated Based Verification Environment for Mobile Processes
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Minimal Transition Systems for History-Preserving Bisimulation
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
From pi-Calculus to Higher-Order pi-Calculus - and Back
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
A First Order Coalgebraic Model of pi-Calculus Early Observational Equivalence
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Checking Bisimilarity for Finitary pi-Calculus
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Final semantics for the pi-calculus
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
Verifying Mobile Processes in the HAL Environment
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
A Fully-Abstract Model for the p-calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
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
A New Approach to Abstract Syntax Involving Binders
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Semantical Analysis of Higher-Order Abstract Syntax
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Abstract Syntax and Variable Binding
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
History-Dependent Automata
About permutation algebras, (pre)sheaves and named sets
Higher-Order and Symbolic Computation
A Name Abstraction Functor for Named Sets
Electronic Notes in Theoretical Computer Science (ENTCS)
Models of Computation: A Tribute to Ugo Montanari's Vision
Concurrency, Graphs and Models
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
Electronic Notes in Theoretical Computer Science (ENTCS)
Some Characterization Results for Permutation Algebras
Electronic Notes in Theoretical Computer Science (ENTCS)
CC-Pi: a constraint-based language for specifying service level agreements
ESOP'07 Proceedings of the 16th European conference on Programming
Families of Symmetries as Efficient Models of Resource Binding
Electronic Notes in Theoretical Computer Science (ENTCS)
Symmetries, local names and dynamic (de)-allocation of names
Information and Computation
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A unifying formal basis for the SENSORIA approach: a white paper
Rigorous software engineering for service-oriented systems
CC-Pi: a constraint language for service negotiation and composition
Rigorous software engineering for service-oriented systems
Counterpart Semantics for a Second-Order μ-Calculus
Fundamenta Informaticae - Recent Developments in the Theory of Graph Transformation, 2010
Hi-index | 0.00 |
The coalgebraic framework developed for the classical process algebras, and in particular its advantages concerning minimal realizations, does not fully apply to the π-calculus, due to the constraints on the freshly generated names that appear in the bisimulation.In this paper we propose to model the transition system of the π-calculus as a coalgebra on a category of name permutation algebras and to define its abstract semantics as the final coalgebra of such a category. We show that permutations are sufficient to represent in an explicit way fresh name generation, thus allowing for the definition of minimal realizations.We also link the coalgebraic semantics with a slightly improved version of history dependent (HD) automata, a model developed for verification purposes, where states have local names and transitions are decorated with names and name relations. HD-automata associated with agents with a bounded number of threads in their derivatives are finite and can be actually minimized. We show that the bisimulation relation in the coalgebraic context corresponds to the minimal HD-antomaton.