Exploiting symmetry in temporal logic model checking
Formal Methods in System Design - Special issue on symmetry in automatic verification
Synthesis of concurrent systems with many similar processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Modern Operating Systems
Parameterized Verification with Automatically Computed Inductive Assertions
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
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
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
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
Local and global deadlock-detection in component-based systems are NP-hard
Information Processing Letters
Liveness in Interaction Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
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
Robustness in Interaction Systems
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Everything Is PSPACE-Complete in Interaction Systems
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Deadlock-freedom in component systems with architectural constraints
Formal Methods in System Design
| Hi-index | 0.00 |
Interaction systems are a formal model for component-based systems. Combining components via connectors to form more complex systems may give rise to deadlock situations. Deciding the existence of deadlocks is NP-hard as it involves global state analysis. We present here a parametrized polynomial-time algorithm that is able to confirm deadlock-freedom for a certain class of interaction systems. The discussion includes characteristic examples and displays the role of the parameter of the algorithm.