Search the dblp DataBase

Publications of Author

1. Wojciech Penczek, Agata Pólrola
   Abstractions and Partial Order Reductions for Checking Branching Properties of Time Petri Nets. [Citation Graph (0, 0)][DBLP]
   ICATPN, 2001, pp:323-342 [Conf]
   
2. Wojciech Penczek, Agata Pólrola
   Specification and Model Checking of Temporal Properties in Time Petri Nets and Timed Automata. [Citation Graph (0, 0)][DBLP]
   ICATPN, 2004, pp:37-76 [Conf]
   
3. Agata Pólrola, Wojciech Penczek, Maciej Szreter
   Towards Efficient Partition Refinement for Checking Reachability in Timed Automata. [Citation Graph (0, 0)][DBLP]
   FORMATS, 2003, pp:2-17 [Conf]
   
4. Piotr Dembinski, Wojciech Penczek, Agata Pólrola
   Automated Verification of Infinite State Concurrent Systems. [Citation Graph (0, 0)][DBLP]
   PPAM, 2001, pp:247-255 [Conf]
   
5. Piotr Dembinski, Agata Janowska, Pawel Janowski, Wojciech Penczek, Agata Pólrola, Maciej Szreter, Bozena Wozna, Andrzej Zbrzezny
   Verics: A Tool for Verifying Timed Automata and Estelle Specifications. [Citation Graph (0, 0)][DBLP]
   TACAS, 2003, pp:278-283 [Conf]
   
6. Piotr Dembinski, Wojciech Penczek, Agata Pólrola
   Verification of Timed Automata Based on Similarity. [Citation Graph (0, 0)][DBLP]
   Fundam. Inform., 2002, v:51, n:1-2, pp:59-89 [Journal]
   
7. Agata Pólrola, Wojciech Penczek
   Minimization Algorithms for Time Petri Nets. [Citation Graph (0, 0)][DBLP]
   Fundam. Inform., 2004, v:60, n:1-4, pp:307-331 [Journal]
   
8. Agata Pólrola, Wojciech Penczek, Maciej Szreter
   Reachability Analysis for Timed Automata Using Partitioning Algorithms. [Citation Graph (0, 0)][DBLP]
   Fundam. Inform., 2003, v:55, n:2, pp:203-221 [Journal]
   
9. Andrzej Zbrzezny, Agata Pólrola
   SAT-Based Reachability Checking for Timed Automata with Discrete Data. [Citation Graph (0, 0)][DBLP]
   Fundam. Inform., 2007, v:79, n:3-4, pp:579-593 [Journal]