Type algebras, functor categories and block structure
Algebraic methods in semantics
Algebraic theory of processes
Communication and concurrency
Equality in lazy computation systems
Proceedings of the Fourth Annual Symposium on Logic in computer science
A domain equation for bisimulation
Information and Computation
Notions of computation and monads
Information and Computation
Semantics of programming languages: structures and techniques
Semantics of programming languages: structures and techniques
A calculus of mobile processes, I
Information and Computation
A calculus of mobile processes, II
Information and Computation
A theory of communicating processes with value passing
Information and Computation
Full abstraction in the lazy lambda calculus
Information and Computation
Lambda-calculi for (strict) parallel functions
Information and Computation
Algebraic theories for name-passing calculi
Information and Computation
Testing equivalence for mobile processes
Information and Computation
Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new?
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
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
A semantic theory for value-passing processes based on the late approach
Information and Computation
Models for name-passing processes: interleaving and causal
Information and Computation
A fully abstract may testing semantics for concurrent objects
Theoretical Computer Science
Free-algebra models for the π -calculus
Theoretical Computer Science
Contracts for Mobile Processes
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Weak bisimilarity coalgebraically
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
A Resource Analysis of the π-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
A fully abstract semantics for UML components
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Free-algebra models for the π-calculus
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
A Denotational Semantics for the π-Calculus
IW-FM'01 Proceedings of the 5th Irish conference on Formal Methods
| Hi-index | 5.23 |
This paper describes the construction of two set-theoretic denotational models for the &pgr;-calculus. The models are obtained as initial solutions to domain equations in a functor category. By associating with each syntactic construct of the &pgr;-calculus a natural transformation over these models we obtain two interpretations for the language. We also show that these models are fully abstract with respect to natural behavioural preorders over terms in the language. By this we mean that two terms are related behaviourally if and only if their interpretations in the model are related. The behavioural preorders are the standard versions of may and must testing adapted to the &pgr;-calculus.