Take It NP-Easy: Bounded Model Construction for Duration Calculus

DOI10.1007/3-540-45739-9_16zbMath1278.68170OpenAlexW1514882327MaRDI QIDQ5392294

Martin Fränzle

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

zbMATH Keywords

complexitymodel constructionbounded model constructiondiscrete-time duration calculus

Mathematics Subject Classification ID

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

Related Items (2)

A survey on temporal logics for specifying and verifying real-time systems ⋮ Decidability of a Hybrid Duration Calculus

This page was built for publication: Take It NP-Easy: Bounded Model Construction for Duration Calculus