Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Dynamic congruence vs. progressing bisimulation for CCS
Fundamenta Informaticae - Special issue on mathematical foundations of computer science '91
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Extensionality and intensionality of the ambient logics
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Distributed processes and location failures
Theoretical Computer Science
Verifiable and Executable Logic Specifications of Concurrent Objects in Lpi
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Localities and Failures (Extended Abstract)
Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
A spatial logic for concurrency (part I)
Information and Computation - TACS 2001
A theory of system behaviour in the presence of node and link failures
CONCUR 2005 - Concurrency Theory
Elimination of quantifiers and undecidability in spatial logics for concurrency
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
An Observational Model for Spatial Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Global computing in a dynamic network of tuple spaces
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
Logical semantics of types for concurrency
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
| Hi-index | 0.00 |
We discuss the tensions between intensionality and extensionality of spatial observations in distributed systems, showing that there are natural models where extensional observational equivalences may be characterized by spatial logics, including the composition and void operators. Our results support the claim that spatial observations do not need to be always considered intensional, even if expressive enough to talk about the structure of systems. For simplicity, our technical development is based on a minimalist process calculus, that already captures the main features of distributed systems, namely local synchronous communication, local computation, asynchronous remote communication, and partial failures.