SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata-Reference-Cited by-同舟云学术

SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata

Published:2010 Issue: Volume: Page:405-419
ISSN:0302-9743
Container-title:Tools and Algorithms for the Construction and Analysis of Systems
language:
Short-container-title:

Author:

Malinowski Janusz,Niebert Peter

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-12002-2_34.pdf

Reference19 articles.

1. Lecture Notes in Computer Science;G. Audemard,2002

2. Behrmann, G., David, A., Larsen, K.G., Hakansson, J., Petterson, P., Yi, W., Hendriks, M.: Uppaal 4.0. In: 3rd international conference on the Quantitative Evaluation of Systems QEST, Washington, DC, USA, pp. 125–126 (2006)

3. Lecture Notes in Computer Science;J. Bengtsson,1998

4. Biere, A.: PicoSAT essentials. Journal on Satisfiability, Boolean Modeling and Computation 4, 75–97 (2008)

5. Lecture Notes in Computer Science;M. Bozga,2002

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Zone-Based Verification of Timed Automata: Extrapolations, Simulations and What Next?;Lecture Notes in Computer Science;2022

2. SMT-based verification of temporal properties for component-based software systems;IFAC-PapersOnLine;2020

3. Optimized Step Semantics Encoding for Bounded Model Checking of Timed Automata;2019

4. Exploring the Relationship between the Structural and the Actual Similarities of Automata;Proceedings of the 3rd International Conference on Machine Learning and Soft Computing - ICMLSC 2019;2019

5. Revisiting Bounded Reachability Analysis of Timed Automata Based on MILP;Formal Methods for Industrial Critical Systems;2018