Take It NP-Easy: Bounded Model Construction for Duration Calculus
From MaRDI portal
Publication:5392294
DOI10.1007/3-540-45739-9_16zbMath1278.68170MaRDI QIDQ5392294
Publication date: 8 April 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-45739-9_16
68Q25: Analysis of algorithms and problem complexity
68Q60: Specification and verification (program logics, model checking, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
A survey on temporal logics for specifying and verifying real-time systems, Decidability of a Hybrid Duration Calculus