Using partial orders for the efficient verification of deadlock freedom and safety properties
Formal Methods in System Design - Special issue on computer-aided verification: special methods II
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
Architecting families of software systems with process algebras
ACM Transactions on Software Engineering and Methodology (TOSEM)
Proving Deadlock Freedom in Component-Based Programming
FASE '01 Proceedings of the 4th International Conference on Fundamental Approaches to Software Engineering
Component-Based Design: Towards Guided Composition
ACSD '03 Proceedings of the Third International Conference on Application of Concurrency to System Design
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
Modeling Environment for Component Model Checking from Hierarchical Architecture
Electronic Notes in Theoretical Computer Science (ENTCS)
Deriving complexity results for interaction systems from 1-safe Petri nets
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Efficiently verifiable conditions for deadlock-freedom of large concurrent programs
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
On the Observable Behaviour of Composite Components
Electronic Notes in Theoretical Computer Science (ENTCS)
Reachability in Tree-Like Component Systems is PSPACE-Complete
Electronic Notes in Theoretical Computer Science (ENTCS)
Analyzing component-based systems on the basis of architectural constraints
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Deadlock-freedom in component systems with architectural constraints
Formal Methods in System Design
| Hi-index | 0.00 |
We study architectural constraints for component systems in order to be able to guarantee safety-properties. Representing safety-properties, we investigate deadlock-freedom. We present a compositional and hence polynomial time condition for deadlock-freedom for a class of component-systems whose architecture is tree-like. The architectural constraints that are developed can be understood as a design pattern that helps to construct systems satisfying safety-properties on the one hand. On the other hand, they might help to draw attention to potentially critical situations in a design. To model component-systems we use the formalism of interaction systems as proposed by Sifakis et al. The ideas can be transferred to other formal models where subsystems are cooperating via synchronous communication.