Communicating sequential processes
Communicating sequential processes
A formal basis for architectural connection
ACM Transactions on Software Engineering and Methodology (TOSEM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
Complexity Results for 1-safe Nets
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Composition for component-based modeling
Science of Computer Programming - Formal methods for components and objects pragmatic aspects and applications
Liveness in Interaction Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Compositional analysis of deadlock-freedom for tree-like component architectures
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
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
Analyzing component-based systems on the basis of architectural constraints
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
| Hi-index | 0.00 |
The reachability problem in component systems is PSPACE-complete. We show here that even the reachability problem in the subclass of component systems with ''tree-like'' communication is PSPACE-complete. For this purpose we reduce the question if a Quantified Boolean Formula (QBF) is true to the reachability problem in ''tree-like'' component systems.