Completion of a set of rules modulo a set of equations
SIAM Journal on Computing
Journal of Automated Reasoning
An algebraic semantics for structured transition systems and its application to logic programs
Theoretical Computer Science - Selected papers of the 7th Annual Symposium on theoretical aspects of computer science (STACS '90) Rouen, France, February 1990
Dynamic congruence vs. progressing bisimulation for CCS
Fundamenta Informaticae - Special issue on mathematical foundations of computer science '91
Handbook of logic in artificial intelligence and logic programming
Journal of the ACM (JACM)
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
A formal basis for architectural connection
ACM Transactions on Software Engineering and Methodology (TOSEM)
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information and Computation - Special issue on EXPRESS 1997
Proof, language, and interaction
A Spatial Logic for Concurrency
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Towards a Verification Logic for Rewriting Logic
WADT '99 Selected papers from the 14th International Workshop on Recent Trends in Algebraic Development Techniques
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Compositionality Through an Operational Semantics of Contexts
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
A Logical Encoding of the pi-Calculus: Model Checking Mobile Processes Using Tabled Resolution
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
From Rewrite to Bisimulation Congruences
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
A Spatial Logic for Concurrency (Part II)
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Coordination for Orchestration
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Computing Symbolic Models for Verifying Cryptographic Protocols
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Deriving bisimulation congruences using 2-categories
Nordic Journal of Computing
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Deriving weak bisimulation congruences from reduction systems
CONCUR 2005 - Concurrency Theory
Saturated Semantics for Reactive Systems
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Locating reaction with 2-categories
Theoretical Computer Science - Foundations of software science and computation structures
A Coordination-based Methodology for Security Protocol Verification
Electronic Notes in Theoretical Computer Science (ENTCS)
Symbolic equivalences for open systems
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
Labels from reductions: towards a general theory
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
On Symbolic Semantics for Name-decorated Contexts
Electronic Notes in Theoretical Computer Science (ENTCS)
Context aware specification and verification of distributed systems
TGC'11 Proceedings of the 6th international conference on Trustworthy Global Computing
Hi-index | 5.23 |
We propose a general methodology for analysing the behaviour of open systems modelled as coordinators, i.e., open terms of suitable process calculi. A coordinator is understood as a process with holes or placeholders where other coordinators and components (i.e., closed terms) can be plugged in, thus influencing its behaviour. The operational semantics of coordinators is given by means of a symbolic transition system, where states are coordinators and transitions are labeled by spatial/modal formulae expressing the potential interaction that plugged components may enable. Behavioural equivalences for coordinators, like strong and weak bisimilarities, can be straightforwardly defined over such a transition system. Different from other approaches based on universal closures, i.e., where two coordinators are considered equivalent when all their closed instances are equivalent, our semantics preserves the openness of the system during its evolution, thus allowing dynamic instantiation to be accounted for in the semantics. To further support the adequacy of the construction, we show that our symbolic equivalences provide correct approximations of their universally closed counterparts, coinciding with them over closed components. For process calculi in suitable formats, we show how tractable symbolic semantics can be defined constructively using unification.