A formal basis for architectural connection
ACM Transactions on Software Engineering and Methodology (TOSEM)
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Proving Deadlock Freedom in Component-Based Programming
FASE '01 Proceedings of the 4th International Conference on Fundamental Approaches to Software Engineering
Complexity Results for 1-safe Nets
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Component-Based Design: Towards Guided Composition
ACSD '03 Proceedings of the Third International Conference on Application of Concurrency to System Design
SOFA/DCUP: Architecture for Component Trading and Dynamic Updating
CDS '98 Proceedings of the International Conference on Configurable Distributed Systems
Reliability prediction for component-based software architectures
Journal of Systems and Software - Special issue on: Software architecture - Engineering quality attributes
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Composition for component-based modeling
Science of Computer Programming - Formal methods for components and objects pragmatic aspects and applications
A Framework for Component-based Construction Extended Abstract
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Modeling Heterogeneous Real-time Components in BIP
SEFM '06 Proceedings of the Fourth IEEE International Conference on Software Engineering and Formal Methods
Architecture-Based Reasoning About Performability in Component-Based Systems
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
An Approach to Modelling and Verification of Component Based Systems
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
A Polynomial-Time Checkable Sufficient Condition for Deadlock-Freedom of Component-Based Systems
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Contracts for BIP: Hierarchical Interaction Models for Compositional Verification
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Robustness in Interaction Systems
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Reachability in Tree-Like Component Systems is PSPACE-Complete
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Interaction systems were proposed and implemented by Sifakis et al. as a model for the design and study of component based systems. We investigate here the property of liveness in interaction systems where liveness of an action, a component or a set of components means that the action (component, set of components) will repeatedly participate in every run of the global system. We show that deciding liveness is NP-hard. Then we present a characterization of liveness. Finally, by exploiting local information, we establish a polynomial-time criterion that guarantees liveness. We combine the criterion with the characterization to obtain a test for liveness.