The gamma model and its discipline of programming
Science of Computer Programming
A calculus of mobile processes, II
Information and Computation
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Some congruence properties for &pgr;-calculus bisimilarities
Theoretical Computer Science
On the expressiveness of internal mobility in name-passing calculi
Theoretical Computer Science
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
Authentication primitives and their compilation
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communication and Concurrency
Proceedings of the 24th International Colloquium on Automata, Languages and Programming
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Proceedings of the 25th International Colloquium on Automata, Languages and Programming
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
The Name Discipline of Uniform Receptiveness (Extended Abstract)
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Distributed Processes and Location Failures (Extended Abstract)
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
A Hierarchy of Equivalences for Asynchronous Calculi
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
On Asynchrony in Name-Passing Calculi
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
The Problem of ``Weak Bisimulation up to''
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Checking Bisimilarity for Finitary pi-Calculus
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Implicit Typing à la ML for the Join-Calculus
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
On Asynchronous Communication Semantics
ECOOP '91 Proceedings of the Workshop on Object-Based Concurrent Computing
An Asynchronous Model of Locality, Failurem and Process Mobility
COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
Bisimulations in the join-calculus
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
The Mobility Workbench - A Tool for the pi-Calculus
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Jocaml: Mobile Agents for Objective-Caml
ASAMA '99 Proceedings of the First International Symposium on Agent Systems and Applications Third International Symposium on Mobile Agents
Bisimulation in Name-Passing Calculi without Matching
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Secure Implementation of Channel Abstractions
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Proof Techniques for Cryptographic Processes
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
May and Must Testing in the Join-Calculus
May and Must Testing in the Join-Calculus
The Join Calculus: A Language for Distributed Mobile Programming
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
On asynchrony in name-passing calculi
Mathematical Structures in Computer Science
Role-based access control for a distributed calculus
Journal of Computer Security - Special issue on CSFW17
Secure implementations of typed channel abstractions
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Translating orc features into petri nets and the join calculus
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
More on bisimulations for higher order π-calculus
Theoretical Computer Science
| Hi-index | 5.23 |
We develop a theory of bisimulations in the join-calculus. We introduce a refined operational model that makes interactions with the environment explicit, and discuss the impact of the lexical scope discipline of the join-calculus on its extensional semantics. We propose several formulations of bisimulation and establish that all formulations yield the same equivalence. We prove that this equivalence is finer than barbed congruence, but that both relations coincide in the presence of name matching. Copyright 2001 Elsevier Science B.V.