On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
&pgr;-calculus, internal mobility, and agent-passing calculi
TAPSOFT '95 Selected papers from the 6th international joint conference on Theory and practice of software development
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Concurrent Constraints in the Fusion Calculus
ICALP '98 Proceedings of the 25th 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
Elementary structures in process theory (1): Sets with renaming
Mathematical Structures in Computer Science
A Spatial Logic for Querying Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
From Process Calculi to Process Frameworks
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
On the bisimulation congruence in χ-calculus
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Graph processes with fusions: concurrency by colimits, again
Formal Methods in Software and Systems Modeling
Concurrent rewriting for graphs with equivalences
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Duality and i/o-types in the π-calculus
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
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 |
We introduce explicit fusions of names. To 'fuse' two names is to declare that they may be used interchangeably. An explicit fusion is one that can exist in parallel with some other process, allowing us to ask for instance how a process might behave in a context where x = y. We present the πF -calculus, a simple process calculus with explicit fusions. It is similar in many respects to the fusion calculus but has a simple local reaction relation. We give embeddings of the π-calculus and the fusion calculus. We provide a bisimulation congruence for the πF -calculus and compare it with hyper-equivalence in the fusion calculus.