Communicating sequential processes
Communicating sequential processes
Executing temporal logic programs
Executing temporal logic programs
Facile: a symmetric integration of concurrent and functional programming
International Journal of Parallel Programming
Process algebra
Research topics in functional programming
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
A calculus of mobile processes, I
Information and Computation
Handbook of logic in computer science (vol. 2)
Lambda-calculi for (strict) parallel functions
Information and Computation
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Comparing locality and causality based equivalences
Acta Informatica
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Interval logics and their decision procedures: part I: an interval logic
Theoretical Computer Science
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
Bisimilarity as a theory of functional programming
Theoretical Computer Science - Special issue on mathematical foundations of programming semantics
Communication and Concurrency
Proceedings of the 19th International Colloquium on Automata, Languages and Programming
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
A Parametric Approach to Localities
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
An Asynchronous Model of Locality, Failurem and Process Mobility
COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
Partial orderings descriptions and observations of nondeterministic concurrent processes
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Localities and Failures (Extended Abstract)
Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
STeP: The Stanford Temporal Prover
STeP: The Stanford Temporal Prover
MetaKlaim: a type safe multi-stage language for global computing
Mathematical Structures in Computer Science
A theory of system behaviour in the presence of node and link failures
CONCUR 2005 - Concurrency Theory
Science of Computer Programming
Extensionality of Spatial Observations in Distributed Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Information and Computation
A theory of system behaviour in the presence of node and link failure
Information and Computation
Network Applications of Graph Bisimulation
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Rational Unification in 28 Characters
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
A fault tolerance bisimulation proof for consensus
ESOP'07 Proceedings of the 16th European conference on Programming
MetaKlaim: meta-programming for global computing
SAIG'01 Proceedings of the 2nd international conference on Semantics, applications, and implementation of program generation
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Synchronised hyperedge replacement as a model for service oriented computing
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
A theory for observational fault tolerance
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
MoMo: a modal logic for reasoning about mobility
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
A language for task orchestration and its semantic properties
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Safety versus security in the quality calculus
Theories of Programming and Formal Methods
| Hi-index | 5.23 |
Site failure is an essential aspect of distributed systems; nonetheless its effect on programming language semantics remains poorly understood. To model such systems, we define a process calculus in which processes are run at distributed locations. The language provides operators to kill locations, to test the status (dead or alive) of locations, and to spawn processes at remote locations. Using a variation of bisimulation, we provide alternative characterizations of strong and weak barbed congruence for this language, based on an operational semantics that uses congurations to record the status of locations. We then derive a second, symbolic characterization in which configurations are replaced by logical formulae. In the strong case the formulae come from a standard propositional logic, while in the weak case a temporal logic with past time modalities is required. The symbolic characterization establishes that, in principle, barbed congruence for such languages can be checked using existing symbolic techniques. Copyright 2001 Elsevier Science B.V.