A syntactic approach to type soundness
Information and Computation
A process algebra for timed systems
Information and Computation
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Resource access control in systems of mobile agents
Information and Computation
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
Mobile ambients with timers and types
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Theory and implementation of a real-time extension to the π-calculus
FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Behavioural equivalences over migrating processes with timers
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
| Hi-index | 0.00 |
The complexity of the software-intensive systems requiresworking with notions as explicit locations in a distributed system,interaction among the mobile processes restricted by interactiontimeouts, time scheduling, and restricted resource access. In orderto work these notions, we use a timed and distributed variant ofthe π -calculus having explicit locations, types forrestricting the resource access, and time constraints forinteraction in distributed systems. Using observation predicates,several behavioural notions are defined and related: (global)barbed bisimulations, (global) typed barbed bisimulation, timed(global) barbed bisimulations, timed (global) typed barbedbisimulation and full timed global typed barbed bisimulation. Thesebisimulations form a lattice according to their distinguishingpower.