W. Penczek and B. Wo'zna, Towards bounded model checking for Timed Automata, Proc. of the Int. Workshop on Concurrency Specification and Programming (CS&P'01), 2001, pp. 195--209. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Model Checking for Multi-Valued CTL - Konikowska And Penczek (2002) (1 citation) Self-citation (Penczek) (Correct)
No context found.
W. Penczek and B. Wo'zna, Towards bounded model checking for Timed Automata, Proc. of the Int. Workshop on Concurrency Specification and Programming (CS&P'01), 2001, pp. 195--209.
Towards Bounded Model Checking for the Universal Fragment.. - Penczek, Wozna, Zbrzezny (2002) (1 citation) Self-citation (Penczek Wo) (Correct)
No context found.
W. Penczek and B. Wozna. Towards bounded model checking for Timed Automata. In Proc. of CS&P'01, p. 195-209, 2001.
Bounded Model Checking for the Universal Fragment of CTL - Penczek, al. (2002) (2 citations) Self-citation (Penczek Wozna) (Correct)
No context found.
Penczek, W., Wozna, B.: Towards Bounded Model Checking for Timed Automata, Proceedings of the Int. Workshop on Concurrency Specification and Programming (CS&P'01), 2001, 195--209.
Wojciech Penczek and Bo_zena Wozna - Bounded (2002) Self-citation (Penczek Wo) (Correct)
....paths and k = 2 11 Final remarks We have shown that the BMC method for the branching time logic ACTL is feasible. The algorithm has been implemented for Elementary Net Systems and our experimental results prove the eciency of the method. The solution presented in this paper di ers from that in [PW01] which could only be applied to a restricted subset of ACTL. The present translation can also be directly exploited for verifying the properties of timed systems expressed in the universal fragment of TCTL. It is interesting to compare the eciency of our method with that for LTL. Since the ....
W. Penczek and B. Wozna. Towards bounded model checking for Timed Automata. In Proc. of the Int. Workshop on Concurrency Speci cation and Programming (CS&P'01), pages 195-209, 2001.
SAT-Based Bounded Model Checking for the Universal.. - Penczek, Wozna, Zbrzezny (2002) Self-citation (Penczek Wo) (Correct)
....state explosion. The major methods include application of partial order reductions [BJLY98,DGKK98,Lil99,Pag96,Pel96,PP01,WG93,YS97] symmetry reductions [ES95] abstraction techniques [DGG94,DT98] BDD based symbolic storage methods [Bry86,McM93] and SAT related algorithms [BCC 99,CBRZ01,HN01,PW01,PWZ02b] Bounded model checking (BMC) based on SAT methods has been recently introduced as a complementary technique to BDD based symbolic model checking for LTL [BCC 99,BCCZ99] An extension of the BMC method to veri cation of the properties expressed in ACTL has been shown for the rst time in ....
....Implementation of BMC for Timed Automata are described in Section 8. Generalizations and further optimizations are discussed in Section 9. Section 10 contains experimental results, whereas nal remarks are given in Section 11. 2 Related Work Our paper is an extended and improved version of [PW01] and [PWZ02c] where a general approach to applying BMC for TACTL was described, but the concurrent systems modeled by a network of timed automata were represented by their product. The idea of BMC for a temporal logic is taken from the papers by Clarke et al. BCC 99,BCCZ99] Timed Automata ....
W. Penczek and B. Wozna. Towards bounded model checking for Timed Automata. In Proc. of the Int. Workshop on Concurrency Speci cation and Programming (CS&P'01), pages 195-209, 2001.
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