Access the full text.
Sign up today, get DeepDyve free for 14 days.
C Zhou, CAR Hoare, AP Ravn (1991)
A calculus of durationsInform. Process. Lett., 40
A Bouajjani, Y Lakhnech, R Robbana (1995)
7th International Conference on Computer Aided Verification, CAV. Lecture Notes in Computer Science, vol. 939
L Moura, N Bjørner (2008)
14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS. Lecture Notes in Computer Science, vol. 4963
DC Oppen (1978)
A $2^{2^{2^{p n}}}$ upper bound on the complexity of Presburger ArithmeticJ. Comput. Syst. Sci., 16
T Bolander, J Hansen, MR Hansen (2007)
Decidability of a hybrid Duration CalculusElectron. Notes Theor. Comput. Sci., 174
R Meyer, J Faber, J Hoenicke, A Rybalchenko (2008)
Model checking Duration Calculus: a practical approachForm. Asp. Comput., 20
C Zhou, J Zang, L Yang, X Li (1994)
Third International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, FTRTFT. Lecture Notes in Computer Science, vol. 863
C Zhou, MR Hansen, P Sestoft (1993)
10th Annual Symposium on Theoretical Aspects of Computer Science, STACS. Lecture Notes in Computer Science, vol. 665
M Fränzle, MR Hansen (2009)
Efficient model checking for Duration CalculusInt. J. Softw. Inform., 3
B Moszkowski (1985)
A temporal logic for multilevel reasoning about hardwareIEEE Comput., 18
M Zhang, D Hung, Z Liu (2008)
5th International Colloquium on Theoretical Aspects of Computing, ICTAC. Lecture Notes in Computer Science, vol. 5160
M Müller-Olm (1999)
Proc. 16th. Symposium on Theoretical Aspects in Computer Science, STACS. Lecture Notes in Computer Science, vol. 1563
J Esparza (1997)
Petri nets, commutative context-free grammars, and basic parallel processesFundam. Inf., 31
V Goranko, A Montanari, G Sciavicco (2003)
Propositional interval neighborhood temporal logicsJ. Univ. Comput. Sci., 9
C Zhou, MR Hansen (2004)
Duration Calculus: A Formal Approach to Real-Time Systems
C Zhou, MR Hansen (1998)
Compositionality: the Significant Difference, COMPOS. Lecture Notes in Computer Science, vol. 1536
MR Hansen (1994)
Model-checking discrete Duration CalculusForm. Asp. Comput., 6
M Fränzle (2004)
Model-checking dense-time Duration CalculusForm. Asp. Comput., 16
M Fränzle, MR Hansen (2008)
6th IEEE International Conference on Software Engineering and Formal Methods, SEFM
JY Halpern, Y Shoham (1991)
A propositional modal logic of time intervalsJ. ACM, 38
N Bjørner (2010)
The 6th International Joint Conference on Automated Reasoning, IJCAR. Lecture Notes in Computer Science, vol. 6173
J Esparza, S Melzer (2000)
Verification of safety properties using integer programming: beyond the state equationForm. Method. Syst. Des., 16
H Seidl, T Schwentick, A Muscholl, P Habermehl (2004)
31st International Colloquium on Automata, Languages and Programming, ICALP. Lecture Notes in Computer Science, vol. 3142
MR Hansen, AW Brekling (2011)
18th International Symposium on Temporal Representation and Reasoning, TIME
This paper investigates the feasibility of reducing a model-checking problem K ⊧ ϕ for discrete time Duration Calculus to the decision problem for Presburger Arithmetic. Theoretical results point at severe limitations of this approach: (1) the reduction in Fränzle and Hansen (Int J Softw Inform 3(2–3):171–196, 2009) produces Presburger formulas whose sizes grow exponentially in the chop-depth of ϕ, where chop is an interval modality originating from Moszkowski (IEEE Comput 18(2):10–19, 1985), and (2) the decision problem for Presburger Arithmetic has a double exponential lower bound and a triple exponential upper bound. The generated Presburger formulas have a rich Boolean structure, many quantifiers and quantifier alternations. Such formulas are simplified using so-called guarded formulas, where a guard provides a context used to simplify the rest of the formula. A normal form for guarded formulas supports global effects of local simplifications. Combined with quantifier-elimination techniques, this normalization gives significant reductions in formula sizes and in the number of quantifiers. As an example, we solve a configuration problem using the SMT-solver Z3 as backend. Benefits and the current limits of the approach are illustrated by a family of examples.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Aug 29, 2013
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.