Selected papers of the Second Workshop on Concurrency and compositionality
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
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
Multisets and structural congruence of the pi-calculus with replication
Theoretical Computer Science
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Nomadic pict: correct communication infrastructure for mobile computation
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Constraints for Free in Concurrent Computation
ACSC '95 Proceedings of the 1995 Asian Computing Science Conference on Algorithms, Concurrency and Knowledge
Concurrent Constraints in the Fusion Calculus
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
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
Service Discovery and Negotiation With COWS
Electronic Notes in Theoretical Computer Science (ENTCS)
A Category of Explicit Fusions
Concurrency, Graphs and Models
Abstract Semantics by Observable Contexts
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
A Categorical Model of the Fusion Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Synthesising CCS bisimulation using graph rewriting
Information and Computation
Structured Communications with Concurrent Constraints
Trustworthy Global Computing
Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
Theoretical Computer Science
CC-Pi: a constraint-based language for specifying service level agreements
ESOP'07 Proceedings of the 16th European conference on Programming
Open bisimulation for the concurrent constraint pi-calculus
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Transactional service level agreement
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Coalgebraic symbolic semantics
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
CC-Pi: a constraint language for service negotiation and composition
Rigorous software engineering for service-oriented systems
A Presheaf Environment for the Explicit Fusion Calculus
Journal of Automated Reasoning
A hierarchy of expressiveness in concurrent interaction nets
CONCUR'13 Proceedings of the 24th 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. An explicit fusion is a process that exists concurrently with the rest of the system and enables two names to be used interchangeably. Explicit fusions provide a small-step account of reaction in process calculi such as the pi calculus and the fusion calculus. In this respect they are similar to the explicit substitutions of Abadi, Cardelli and Curien, which do the same for the lambda calculus. In this paper, we give a technical foundation for explicit fusions. We present the pi-F calculus, a simple process calculus with explicit fusions, and define a strong bisimulation congruence. We study the embeddings of the fusion calculus and the pi calculus. The former is fully abstract with respect to bisimulation.