scientific article; zbMATH DE number 2038755

MaRDI QIDQ4449220zbMATH OpenFDO

Authors Philippe Schnoebelen

Publication date 8 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2719/27190790.htm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• An automata-theoretic approach to branching-time model checking
• scientific article; zbMATH DE number 1705163
• Relativized circuit complexity
• Modalities for model checking: Branching time logic strikes back
• scientific article; zbMATH DE number 17817

Cited in

(9)

• Model checking for fragments of Halpern and Shoham's interval temporal logic based on track representatives
• Which fragments of the interval temporal logic HS are tractable in model checking?
• Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy
• Branching time and orthogonal bisimulation equivalence
• Choice logics and their computational properties
• Model checking interval temporal logics with regular expressions
• Efficient timed model checking for discrete-time systems
• scientific article; zbMATH DE number 6712240 (Why is no real title available?)
• Model checking the logic of Allen's relations \textit{Meets} and \textit{Started-by} is \(\mathbf{P}^{\mathbf{NP}}\)-complete

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449220)