A calculus of mobile processes, II
Information and Computation
Structural operational semantics for weak bisimulations
Theoretical Computer Science
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Communication and Concurrency
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
A fully abstract denotational semantics for the π-calculus
Theoretical Computer Science
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
A First Order Coalgebraic Model of pi-Calculus Early Observational Equivalence
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Obseving Behaviour Categorically
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Final semantics for the pi-calculus
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
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
Weak Bisimulation and Open Maps
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Models for Name-Passing Processes: Interleaving and Causal
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Weak Bisimulation for Action-Type Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
A domain equation for bisimulation
Information and Computation
A fully abstract encoding of the π-calculus with data terms
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On cool congruence formats for weak bisimulations
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Incremental pattern-based coinduction for process algebra and its isabelle formalization
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
| Hi-index | 0.00 |
We argue that weak bisimilarity of processes can be conveniently captured in a semantic domain by a combination of traces and coalgebraic finality, in such a way that important process algebra aspects such as parallel composition and recursion can be represented compositionally. We illustrate the usefulness of our approach by providing a fully-abstract denotational semantics for CCS under weak bisimilarity.