On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Distributed processes and location failures
Theoretical Computer Science
Resource access control in systems of mobile agents
Information and Computation
Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract)
MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
An Asynchronous Model of Locality, Failurem and Process Mobility
COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
Typed behavioural equivalences for processes in the presence of subtyping
Mathematical Structures in Computer Science
Towards a behavioural theory of access and mobility control in distributed systems
Theoretical Computer Science - Special issue: Foundations of wide area network computing
Global computing in a dynamic network of tuple spaces
Science of Computer Programming
An Observational Theory for Mobile Ad Hoc Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Implementing a Distributed Mobile Calculus Using the IMC Framework
Electronic Notes in Theoretical Computer Science (ENTCS)
Extensionality of Spatial Observations in Distributed Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Basic observables for a calculus for global computing
Information and Computation
A theory of system behaviour in the presence of node and link failure
Information and Computation
An Observational Theory for Mobile Ad Hoc Networks (full version)
Information and Computation
A fault tolerance bisimulation proof for consensus
ESOP'07 Proceedings of the 16th European conference on Programming
Linear uniform receptiveness in a pi-calculus with location failures
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
A theory for observational fault tolerance
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
A mobility calculus with local and dependent types
Processes, Terms and Cycles
Hi-index | 0.00 |
We develop a behavioural theory of distributed programs in the presence of failures such as nodes crashing and links breaking. The framework we use is that of MediaObjects/InlineFigure1.png, a language in which located processes, or agents, may migrate between dynamically created locations. In our extended framework, these processes run on a distributed network, in which individual nodes may crash in fail-stop fashion or the links between these nodes may become permanently broken. The original language, MediaObjects/InlineFigure2.png, is also extended by a ping construct for detecting and reacting to these failures. We define a bisimulation equivalence between these systems, based on labelled actions which record, in addition to the effect actions have on the processes, the effect on the actual state of the underlying network and the view of this state known to observers. We prove that the equivalence is fully abstract, in the sense that two systems will be differentiated if and only if, in some sense, there is a computational context, consisting of a surrounding network and an observer, which can see the difference.