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

DOI10.1007/3-540-45739-9_16MaRDI QIDQ5392294zbMATH OpenOpenAlexFDO

Authors 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) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Bounded model-checking of discrete duration calculus
• On the completeness and decidability of duration calculus with iteration
• Model Checking Duration Calculus: A Practical Approach
• Model checking duration calculus: a practical approach
• A practical approach to model checking duration calculus using Presburger arithmetic
• scientific article; zbMATH DE number 512815
• Axiomatisation and decidability of multi-dimensional Duration Calculus
• Decidability of a hybrid duration calculus
• A simple model construction for the calculus of constructions
• Specifying Various Time Models with Temporal Propositional Variables in Duration Calculus

Cited in

(4)

• A practical approach to model checking duration calculus using Presburger arithmetic
• A survey on temporal logics for specifying and verifying real-time systems
• Decidability of a hybrid duration calculus
• Bounded model-checking of discrete duration calculus

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

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