Communicating sequential processes
Communicating sequential processes
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
A calculus of mobile processes, II
Information and Computation
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
From rewrite rules to bisimulation congruences
Theoretical Computer Science
A Calculus of Communicating Systems
A Calculus of Communicating Systems
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
Mobility Types for Mobile Ambients
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
Deriving Bisimulation Congruences for Reactive Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Typing and Subtyping Mobility in Boxed Ambients
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Deriving bisimulation congruences using 2-categories
Nordic Journal of Computing
Equational properties of mobile ambients
Mathematical Structures in Computer Science
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Behavioral theory for mobile ambients
Journal of the ACM (JACM)
Acta Informatica
Boxed ambients with communication interfaces
Mathematical Structures in Computer Science
Deriving Structural Labelled Transitions for Mobile Ambients
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Reactive Systems, Barbed Semantics, and the Mobile Ambients
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Making the Unobservable, Unobservable
Electronic Notes in Theoretical Computer Science (ENTCS)
Semantic barbs and biorthogonality
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Towards a general theory of barbs, contexts and labels
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
| Hi-index | 0.00 |
We present a new labelled transition system (lts) for the ambient calculus. Its most important property is that ordinary (strong) bisimulation coincides with (strong) contextual equivalence. The lts is the outcome of the authors' ongoing work towards developing general techniques and systematic procedures for deriving ltss in the structural (sos) style from the underlying reduction semantics and observability.