Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Hypergraph rewriting: critical pairs and undecidability of confluence
Term graph rewriting
Exterminating the Dynamic Change Bug: A Concrete Approach to Support Workflow Change
Information Systems Frontiers
Confluence of Typed Attributed Graph Transformation Systems
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
Compositional semantics for open Petri nets based on deterministic processes
Mathematical Structures in Computer Science
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
Modeling component connectors in Reo by constraint automata
Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Connector colouring I: Synchronisation and context dependency
Science of Computer Programming
Symbolic Model Checking for Channel-based Component Connectors
Electronic Notes in Theoretical Computer Science (ENTCS)
A Basic Logic for Reasoning about Connector Reconfiguration
Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
Explicit State Model Checking for Graph Grammars
Concurrency, Graphs and Models
Automata for Context-Dependent Connectors
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
Reconfiguring Distributed Reo Connectors
Recent Trends in Algebraic Development Techniques
Data-aware design and verification of service compositions with Reo and mCRL2
Proceedings of the 2010 ACM Symposium on Applied Computing
Specifying and verifying the SYNERGY reconfiguration protocol with LOTOS NT and CADP
FM'11 Proceedings of the 17th international conference on Formal methods
Formal modeling
Modelling and analysis of dynamic reconfiguration in BP-Calculus
KES-AMSTA'12 Proceedings of the 6th KES international conference on Agent and Multi-Agent Systems: technologies and applications
Using coordinated actors to model families of distributed systems
COORDINATION'12 Proceedings of the 14th international conference on Coordination Models and Languages
Validating reconfigurations of reo circuits in an e-Banking scenario
Proceedings of the 4th international ACM Sigsoft symposium on Architecting critical systems
On the reconfiguration of software connectors
Proceedings of the 28th Annual ACM Symposium on Applied Computing
An experience report on the verification of autonomic protocols in the cloud
Innovations in Systems and Software Engineering
A compositional model to reason about end-to-end QoS in Stochastic Reo connectors
Science of Computer Programming
Towards a formal analysis of dynamic reconfiguration in WS-BPEL
Intelligent Decision Technologies
Hi-index | 0.00 |
Reo is a channel-based coordination language, wherein circuit-like connectors model and implement interaction protocols in heterogeneous environments that coordinate components or services. Connectors are constructed from primitive channels and can be reconfigured dynamically. Reconfigurations can even execute within a pending I/O transaction. In this article, we formally model and analyze dynamic reconfigurations and show how running coordinators can be reconfigured without the cooperation of their engaged components. We utilize the theory of high-level replacement systems to model rule-based reconfigurations of connectors. This allows us to perform a complex reconfiguration as an atomic step and analyze it using formal verification techniques. Specifically, we formalize the structure of connectors as typed hypergraphs and use critical pair and state space analyses for verification of dynamic reconfigurations. We provide a full implementation of our approach in a framework that includes tools for the definition, analysis, and execution of reconfigurations, and is integrated with two execution engines for Reo. Our framework, moreover, integrates with the graph transformation tools AGG and GROOVE for formal analysis, as well as the Eclipse platform and standard web service technologies.