Publication:4381382
From MaRDI portal
zbMath0919.03012MaRDI QIDQ4381382
Stéphane P. Demri, Philippe Schnoebelen
Publication date: 19 August 1999
68Q25: Analysis of algorithms and problem complexity
03B45: Modal logic (including the logic of norms)
68Q60: Specification and verification (program logics, model checking, etc.)
03D15: Complexity of computation (including implicit computational complexity)
Related Items
A polynomial space construction of tree-like models for logics with local chains of modal connectives, Specification in CTL + past for verification in CTL., The complexity of propositional linear temporal logics in simple cases, Is your model checker on time? On the complexity of model checking for timed modal logics