Complexity of compositional model checking of computation tree logic on simple structures
LNCS
Krishnendu Chatterjee
Dasgupta, Pallab
Chakrabarti, Partha P
Temporal Logic Model Checking is one of the most potent tools for the verification of finite state systems. Computation Tree Logic (CTL) has gained popularity because unlike most other logics, CTL model checking of a single transition system can be achieved in polynomial time. However, in most real-life problems, specially in distributed and parallel systems, the system consist of a set of concurrent processes and the verification problem translates to model check the composition of the component processes. Since explicit composition leads to state explosion, verifying the system without actually composing the components is attractive, even for possibly restrictive class of systems. We show that the problem of compositional CTL model checking is PSPACE complete for the class of systems composed of components that are tree-like transition structure and do not interact among themselves. For the simplest forms of existential and universal CTL formulas model checking turns out to be NP complete and coNP complete, respectively. The results hold for both synchronous and asynchronous composition.
Springer
2005
info:eu-repo/semantics/conferenceObject
doc-type:conferenceObject
text
http://purl.org/coar/resource_type/c_5794
https://research-explorer.app.ist.ac.at/record/3896
Chatterjee K, Dasgupta P, Chakrabarti P. Complexity of compositional model checking of computation tree logic on simple structures. In: Vol 3326. Springer; 2005:89-102. doi:<a href="https://doi.org/10.1007/978-3-540-30536-1_13">10.1007/978-3-540-30536-1_13</a>
info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-540-30536-1_13
info:eu-repo/semantics/closedAccess