On the computational strength of pure ambient calculi
Theoretical Computer Science - Expressiveness in concurrency
Leader election in rings of ambient processes
Theoretical Computer Science - Expressiveness in concurrency
When ambients cannot be opened
Theoretical Computer Science - Foundations of software science and computation structures
Tutorial on separation results in process calculi via leader election problems
Theoretical Computer Science
Symmetric electoral systems for ambient calculi
Information and Computation
Theoretical Computer Science
On the Relative Expressive Power of Ambient-Based Calculi
Trustworthy Global Computing
Deciding reachability problems in turing-complete fragments of mobile ambients
Mathematical Structures in Computer Science
Instant polymorphic type systems for mobile process calculi: just add reduction rules and close
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Hi-index | 0.00 |