Algebraic theory of processes
Communication and concurrency
Information and Computation
A domain equation for bisimulation
Information and Computation
Research topics in functional programming
Termination, deadlock, and divergence
Journal of the ACM (JACM)
A calculus of mobile processes, I
Information and Computation
A theory of communicating processes with value passing
Information and Computation
A fully abstract denotational model for higher-order processes
Information and Computation
Late and early semantics coincide for testing
Theoretical Computer Science
Initial Algebra Semantics and Continuous Algebras
Journal of the ACM (JACM)
Concurrent Processes and Their Syntax
Journal of the ACM (JACM)
Communicating sequential processes
Communications of the ACM
A Calculus of Communicating Systems
A Calculus of Communicating Systems
A fully abstract denotational semantics for the π-calculus
Theoretical 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
Modal Logics for Mobile Processes
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Proof Systems for Message-Passing Process Algebras
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
A Modal Logic for Message passing Processes (Extended Abstract)
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
MFCS '80 Proceedings of the 9th 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
Hi-index | 0.00 |
A general class of languages for value-passing calculi based on the late semantic approach is defined and a concrete instantiation of the general syntax is given. This is a modification of the standard CCS according to the late approach. Three kinds of semantics are given for this language. First a Plotkin style operational semantics by means of an applicative labelled transition system is introduced. This is a modification of the standard labelled transition system that caters for value-passing according to the late approach. As an abstraction, late bisimulation preorder is given. Then a general class of denotational models for the late semantics is defined. A denotational model for the concrete language is given as an instantiation of the general class. Two equationally based proof systems are defined. The first one, which is value-finitary, i.e., only reasons about a finite number of values at each time, is shown to be sound and complete with respect to this model. The second proof system, a value-infinitary one, is shown to be sound with respect to the model, whereas the completeness is proven later. The operational and the denotational semantics are compared and it is shown that the bisimulation preorder is finer than the preorder induced by the denotational model. We also show that in general the ω-bisimulation preorder is strictly included in the model induced preorder. Finally a value-finitary version of the bisimulation preorder is defined and the full abstractness of the denotational model with respect to it is shown. It is also shown that for CCSL the ω-bisimulation preorder coincides with the preorder induced by the model. From this we can conclude that if we allow for parameterized recursion in our language, we may express processes which coincide in any algebraic domain but are distinguished by the ω-bisimulation. This shows that if we extend CCSL in this way we obtain a strictly more expressive language.