Communicating sequential processes
Communicating sequential processes
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
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
Equational properties of mobile ambients
Mathematical Structures in Computer Science
Behavioral theory for mobile ambients
Journal of the ACM (JACM)
A bisimulation-based semantic theory of Safe Ambients
ACM Transactions on Programming Languages and Systems (TOPLAS)
Acta Informatica
Boxed ambients with communication interfaces
Mathematical Structures in Computer Science
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
Deriving structural labelled transitions for mobile ambients
Information and Computation
Saturated LTSs for adhesive rewriting systems
ICGT'10 Proceedings of the 5th international conference on Graph transformations
LTS semantics for process calculi from their graphical encodings
ICGT'10 Proceedings of the 5th international conference on Graph transformations
On the semantics of Markov automata
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Characterizing contextual equivalence in calculi with passivation
Information and Computation
Measurable stochastics for Brane Calculus
Theoretical Computer Science
Open bisimulation for quantum processes
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
A modular LTS for open reactive systems
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
On the semantics of Markov automata
Information and Computation
| Hi-index | 0.00 |
We present a new labelled transition system (lts) for the ambient calculus on which ordinary bisimilarity coincides with contextual equivalence. The key feature of this ltsis that it is the fruit of ongoing work on developing a systematic procedure for deriving ltss in the structural style from the underlying reduction semantics and observability. Notably, even though we have derived our ltsfor ambients systematically it compares very favourably with existing transition systems for the same calculus.