A Complete Symbolic Bisimulation for Full Applied Pi Calculus
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Deriving labels and bisimilarity for concurrent constraint programming
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Broadcast psi-calculi with an application to wireless protocols
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
ASPfun: A typed functional active object calculus
Science of Computer Programming
Repairing time-determinism in the process algebra for hybrid systems ACPhssrt
Theoretical Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
A complete symbolic bisimulation for full applied pi calculus
Theoretical Computer Science
Spatial and epistemic modalities in constraint-based process calculi
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Efficient computation of program equivalence for confluent concurrent constraint programming
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Name-Passing Calculi: From Fusions to Preorders and Types
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
A psi-calculus is an extension of the pi-calculus with nominal data types for data structures and for logical assertions representing facts about data. These can be transmitted between processes and their names can be statically scoped using the standard pi-calculus mechanism to allow for scope migrations. Other proposed extensions of the pi-calculus can be formulated as psi-calculi; examples include the applied pi-calculus, the spi-calculus, the fusion calculus, the concurrent constraint pi-calculus, and calculi with polyadic communication channels or pattern matching. Psi-calculi can be even more general, for example by allowing structured channels, higher-order formalisms such as the lambda calculus for data structures, and a predicate logic for assertions. Our labelled operational semantics and definition of bisimulation is straightforward, without a structural congruence. We establish minimal requirements on the nominal data and logic in order to prove general algebraic properties of psi-calculi. The proofs have been checked in the interactive proof checker Isabelle. We are the first to formulate a truly compositional labelled operational semantics for calculi of this calibre. Expressiveness and therefore modelling convenience significantly exceeds that of other formalisms, while the purity of the semantics is on par with the original pi-calculus.