W. Penczek and A. Po lrola. Abstractions and partial order reductions for checking branching properties of Time Petri Nets. In Proc. of the Int. Conf. on Applications and Theory of Petri Nets (ICATPN'01), volume 2075 of LNCS, pages 323-342. Springer-Verlag, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
State Class Constructions for Branching Analysis of Time.. - Berthomieu, Vernadat (2003) (1 citation) (Correct)
.... s) In their most general de nition, state class graphs, or spaces, are covers of the set of states of the TPN such that all states in each class bear the same marking, equipped with a transition relation satisfying (EE) State class spaces are similar to the abstract state spaces of [PP01] except that we allow a concrete state to belong to several classes. Our goal is to build state class graphs that preserve the branching properties of a TPN, that is of its state graph. Branching properties are those expressed in modal logics like HML or in branching time temporal logics like ....
....to preservation of full branching properties, as, in our context, this implies preservation of truth values of formulas of the strongest available temporal logics. The ASCG construction can be further re ned to only preserve formulas of weaker logics, like the sublogics of CTL considered in [PP01] using the techniques developed in their paper. Our immediate goals are to improve the algorithmics for construction of the ASCG. Longer term goals include investigation of partial order techniques [PP01] to reduce further its size, and systematic methods for checking formulas of logics with ....
[Article contains additional citation context not shown here]
W. Penczek and A. Prola. Abstraction and partial order reductions for checking branching properties of time petri nets. In Proc. of ICATPN, Springer LNCS 2075, pages 323342, 2001.
Minimization Algorithms for Time Petri Nets - Polrola, Penczek (2003) Self-citation (Penczek Lrola) (Correct)
No context found.
W. Penczek and A. Po lrola. Abstractions and partial order reductions for checking branching properties of Time Petri Nets. In Proc. of the Int. Conf. on Applications and Theory of Petri Nets (ICATPN'01), volume 2075 of LNCS, pages 323-342. Springer-Verlag, 2001.
Towards Bounded Model Checking for the Universal Fragment.. - Penczek, Wozna, Zbrzezny (2002) (1 citation) Self-citation (Penczek) (Correct)
No context found.
W. Penczek and A. Po lrola. Abstractions and partial order reductions for checking branching properties of Time Petri Nets. In Proc. of ICATPN'01, volume 2075 of LNCS, p. 323-342. Springer-Verlag, 2001.
SAT-Based Bounded Model Checking for the Universal.. - Penczek, Wozna, Zbrzezny (2002) Self-citation (Penczek) (Correct)
....applicability of model checking is strongly restricted by the state explosion problem. Therefore, many di erent reduction techniques have been introduced in order to alleviate the 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 ....
W. Penczek and A. Po lrola. Abstractions and partial order reductions for checking branching properties of Time Petri Nets. In Proc. of the Int. Conf. on Applications and Theory of Petri Nets (ICATPN'01), volume 2075 of LNCS, pages 323-342. Springer-Verlag, 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