Theoretical Computer Science
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The geometry of optimal lambda reduction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A calculus of mobile processes, II
Information and Computation
On the &pgr;-calculus and linear logic
MFPS '92 Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Pict: a programming language based on the Pi-Calculus
Proof, language, and interaction
Proof, language, and interaction
Nordic Journal of Computing
Pi-Nets: A Graphical Form of pi-Calculus
ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
Graph Notation for Concurrent Combinators
TPPP '94 Proceedings of the International Workshop on Theory and Practice of Parallel Programming
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
A Proof Theoretical Approach to Communication
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Mathematical Structures in Computer Science
On the bisimulation proof method
Mathematical Structures in Computer Science
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Mathematical Structures in Computer Science
Multiport interaction nets and concurrency
CONCUR 2005 - Concurrency Theory
Concurrent nets: a study of prefixing in process calculi
Theoretical Computer Science - Expressiveness in concurrency
Theoretical Computer Science - Mathematical foundations of computer science 2000
Graph rewriting for the π-calculus
Mathematical Structures in Computer Science
Modelling and Verifying Mobile Systems Using π -Graphs
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
On Term Graphs as an Adhesive Category
Electronic Notes in Theoretical Computer Science (ENTCS)
An exact correspondence between a typed pi-calculus and polarised proof-nets
Theoretical Computer Science
Interpreting a finitary pi-calculus in differential interaction nets
Information and Computation
Graph processes with fusions: concurrency by colimits, again
Formal Methods in Software and Systems Modeling
| Hi-index | 0.00 |
We address the problems of implementing the replication operator efficiently in the solos calculus - a calculus of mobile processes without prefix. This calculus is expressive enough to admit an encoding of the whole fusion calculus and thus the 驴-calculus. We show that nested occurrences of replication can be avoided, that the size of replicated terms can be limited to three particles, and that the usual unfolding semantics of replication can be replaced by three simple reduction rules. To illustrate the results and show how the calculus can be efficiently implemented we present a graphic representation of agents in the solos calculus, adapting ideas from interaction diagrams and pi-nets.