| 2008 |
|---|
| 11 | EE | Magdalena Kacprzak,
Wojciech Nabialek,
Artur Niewiadomski,
Wojciech Penczek,
Agata Pólrola,
Maciej Szreter,
Bozena Wozna,
Andrzej Zbrzezny:
VerICS 2007 - a Model Checker for Knowledge and Real-Time.
Fundam. Inform. 85(1-4): 313-328 (2008) |
| 2007 |
|---|
| 10 | EE | Andrzej Zbrzezny,
Agata Pólrola:
SAT-Based Reachability Checking for Timed Automata with Discrete Data.
Fundam. Inform. 79(3-4): 579-593 (2007) |
| 2006 |
|---|
| 9 | | Wojciech Penczek,
Agata Pólrola:
Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach.
Springer 2006 |
| 2004 |
|---|
| 8 | EE | Wojciech Penczek,
Agata Pólrola:
Specification and Model Checking of Temporal Properties in Time Petri Nets and Timed Automata.
ICATPN 2004: 37-76 |
| 7 | EE | Agata Pólrola,
Wojciech Penczek:
Minimization Algorithms for Time Petri Nets.
Fundam. Inform. 60(1-4): 307-331 (2004) |
| 2003 |
|---|
| 6 | EE | Agata Pólrola,
Wojciech Penczek,
Maciej Szreter:
Towards Efficient Partition Refinement for Checking Reachability in Timed Automata.
FORMATS 2003: 2-17 |
| 5 | EE | 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.
TACAS 2003: 278-283 |
| 4 | EE | Agata Pólrola,
Wojciech Penczek,
Maciej Szreter:
Reachability Analysis for Timed Automata Using Partitioning Algorithms.
Fundam. Inform. 55(2): 203-221 (2003) |
| 2002 |
|---|
| 3 | | Piotr Dembinski,
Wojciech Penczek,
Agata Pólrola:
Verification of Timed Automata Based on Similarity.
Fundam. Inform. 51(1-2): 59-89 (2002) |
| 2001 |
|---|
| 2 | EE | Wojciech Penczek,
Agata Pólrola:
Abstractions and Partial Order Reductions for Checking Branching Properties of Time Petri Nets.
ICATPN 2001: 323-342 |
| 1 | EE | Piotr Dembinski,
Wojciech Penczek,
Agata Pólrola:
Automated Verification of Infinite State Concurrent Systems.
PPAM 2001: 247-255 |
