M. Sorea. Bounded model checking for timed automata. Electronic Notes in Theoretical Computer Science, 68(5), 2002. Available at http://www.elsevier.com/locate/entcs/volume68. html. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Checking Reachability Properties for Timed Automata via SAT - Wozna, Penczek, Zbrzezny (2002) (Correct)
....[dMRS02] the BMC method has been extended to systems of in nite state spaces and LTL formulas augmented with a decidable set of constraints. The BMC problem is encoded into the problem of deciding the satis ability of Boolean constraint formulas over decidable linear arithmetic constraints. Sorea [Sor02] applies the method described in [dMRS02] to the veri cation of timed automata. Niebert at al. NMA 02] show how to translate bounded length veri cation problems for timed automata into formulas in di erence logic, a propositional logic enriched with timing constraints. Our paper follows the ....
Maria Sorea. Bounded model checking for timed automata. In Proc. of the Third Workshop on Models for Time-Critical Systems (MTCS'02); aliated with CONCUR 2002., volume 68(5) of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2002.
Model Checking a Fault-Tolerant Startup Algorithm: From Design .. - Steiner, al. (2004) (2 citations) Self-citation (Sorea) (Correct)
No context found.
M. Sorea. Bounded model checking for timed automata. Electronic Notes in Theoretical Computer Science, 68(5), 2002. Available at http://www.elsevier.com/locate/entcs/volume68. html.
Bounded Model Checking and Induction: From Refutation to.. - de Moura, Rueß, Sorea (2003) (6 citations) (Correct)
No context found.
M. Sorea. Bounded model checking for timed automata. In Proceedings of MTCS 2002, volume 68 of Electronic Notes in Theoretical Computer Science, 2002.
Lemmas on Demand for Satisfiability Solvers - de Moura, Rueß (2002) (4 citations) (Correct)
No context found.
Maria Sorea. Bounded model checking for timed automata. Electronic Notes in Theoretical Computer Science, 68(5), 2002.
Technical Report SRI-CSL-03-05 - November Updated January (Correct)
No context found.
Maria Sorea. Bounded model checking for timed automata. Electronic Notes in Theoretical Computer Science, 68(5), 2002. Available at http: //www.elsevier.com/locate/entcs/volume68.html.
Checking Reachability Properties for Timed Automata via SAT - Wozna, Zbrzezny, Penczek (2003) (Correct)
No context found.
Maria Sorea. Bounded model checking for timed automata. In Proc. of MTCS'02, vol. 68(5) of ENTCS. Elsevier Science Publishers, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC