Compile-time analysis of communicating processes
ICS '92 Proceedings of the 6th international conference on Supercomputing
Modern Operating Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
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
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
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
| Hi-index | 0.89 |
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. We present here a polynomial time reduction from 3-SAT to the question whether an interaction system contains deadlocks.