POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Selected papers of the Second Workshop on Concurrency and compositionality
A calculus of mobile processes, I
Information and Computation
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A calculus for cryptographic protocols: the spi calculus
Proceedings of the 4th ACM conference on Computer and communications security
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Journal of the ACM (JACM)
Pict: a programming language based on the Pi-Calculus
Proof, language, and interaction
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Deriving Bisimulation Congruences for Reactive Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Nomadic Pict: Language and Infrastructure Design for Mobile Agents
ASAMA '99 Proceedings of the First International Symposium on Agent Systems and Applications Third International Symposium on Mobile Agents
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
| Hi-index | 0.00 |
A graphical model of interactive systems called bigraphs is introduced, resting on the orthogonal treatment of connectivity and locality. The model will be shown to underlie several calculi for mobile systems, in particular the π-calculus and the ambient calculus. Its core behavioural theory will be outlined.