POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Transition system specifications with negative premises
Theoretical Computer Science
The algebra of timed processes, ATP: theory and application
Information and Computation
A process algebra for timed systems
Information and Computation
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
Discrete time process algebra: absolute time, relative time and parametric time
Fundamenta Informaticae
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
A Distributed Pi-Calculus
Timed Mobile Ambients for Network Protocols
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Behaviour Equivalences in Timed Distributed π -Calculus
Software-Intensive Systems and New Computing Paradigms
Modelling and verification of timed interaction and migration
FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
Timed migration and interaction with access permissions
FM'11 Proceedings of the 17th international conference on Formal methods
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
Flexible software architecture and language for mobile agents
Concurrency and Computation: Practice & Experience
Hi-index | 0.00 |
The temporal evolution of mobile processes is governed by independently operating local clocks and their migration timeouts. We define a formalism modelling such distributed systems allowing (maximal) parallel execution at each location. Taking into account explicit timing constraints based on migration and interprocess communication, we introduce and study a number of timed behavioural equivalences, aiming to provide theoretical underpinnings of verification methods. We also investigate relationships between such behavioural equivalences.