Interval structure: a framework for representing uncertain information
UAI '92 Proceedings of the eighth conference on Uncertainty in Artificial Intelligence
An action-based framework for verifying logical and behavioural properties of concurrent systems
Computer Networks and ISDN Systems - Special issue on tools for FDTs
Concurrent programming in ERLANG (2nd ed.)
Concurrent programming in ERLANG (2nd ed.)
Protocol specifications and component adaptors
ACM Transactions on Programming Languages and Systems (TOPLAS)
The discrete time TOOLBUS—a software coordination architecture
Science of Computer Programming
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Model checking
Proof, language, and interaction
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Tree-Like Counterexamples in Model Checking
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
The logic of public announcements, common knowledge, and private suspicions
TARK '98 Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge
Formalizing Properties of Mobile Agent Systems
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
On-the-Fly Model Checking of RCTL Formulas
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Rewriting Logic as a Unifying Framework for Petri Nets
Unifying Petri Nets, Advances in Petri Nets
Dynamic rebinding for marshalling and update, with destruct-time ?
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
Models and Temporal Logics for Timed Component Connectors
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Abstract behavior types: a foundation model for components and their composition
Science of Computer Programming - Formal methods for components and objects pragmatic aspects and applications
Construction of negotiation protocols for e-commerce applications
ACM SIGecom Exchanges
Quantitative analysis of probabilistic lossy channel systems
Information and Computation
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)
A basic algebra of stateless connectors
Theoretical Computer Science - Algebra and coalgebra in computer science
Modeling the Exogenous Coordination of Mobile Channel-based Systems with Petri Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Verifying temporal heap properties specified via evolution logic
ESOP'03 Proceedings of the 12th European conference on Programming
Petri Nets for Systems Engineering: A Guide to Modeling, Verification, and Applications
Petri Nets for Systems Engineering: A Guide to Modeling, Verification, and Applications
Modelling coordination in biological systems
ISoLA'04 Proceedings of the First international conference on Leveraging Applications of Formal Methods
Coordination: Reo, Nets, and Logic
Formal Methods for Components and Objects
Comparing three coordination models: Reo, ARC, and PBRD
Science of Computer Programming
Modeling dynamic reconfigurations in Reo using high-level replacement systems
Science of Computer Programming
Channel-based coordination via constraint satisfaction
Science of Computer Programming
Formal modeling
On the reconfiguration of software connectors
Proceedings of the 28th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
Software systems evolve over time. From a component-based software engineering perspective, this means that either the components of the system need to change, or, if components are connected using a coordination layer, then the way in which they are connected needs to change, or both. In some situations, changes must be performed without stopping the running system. This not only introduces a serious technological challenge, it also makes reasoning about the evolving system difficult. One approach to this problem is to use component connectors to plug components together. Reconfiguration of a system can then be reduced to reconfiguring the component connector, as changing component implementations can be implemented by changing which components the connector connects together. The coordination language Reo offers operations to dynamically reconfigure the topology of component connectors, but until now, no means for reasoning about reconfiguration in Reo has been developed. This issue is addressed in this paper. To enable reasoning about connector behaviour, and hence behaviour of the composed system, we present a semantics of Reo in the presence of reconfiguration, and a logic together with its model checking algorithm.