Agata Pólrola

Publication Activity (10 Years)

Years Active: 2001-2017
Publications (10 Years): 1

Top Topics

Discrete Event Systems

Composition Of Web Services

Top Venues

Fundam. Informaticae

Trans. Petri Nets Other Model. Concurr.

Publications

Artur Niewiadomski, Wojciech Penczek, Jaroslaw Skaruz, Maciej Szreter, Agata Pólrola
Combining ontology reductions with new approaches to automated abstract planning of Planics. Appl. Soft Comput. 53 (2017)
Agata Pólrola, Piotr Cybula, Artur Meski
SMT-Based Reachability Checking for Bounded Time Petri Nets. Fundam. Informaticae 135 (4) (2014)
Agata Janowska, Wojciech Penczek, Agata Pólrola, Andrzej Zbrzezny
Using Integer Time Steps for Checking Branching Time Properties of Time Petri Nets. Trans. Petri Nets Other Model. Concurr. 8 (2013)
Agata Pólrola, Piotr Cybula, Artur Meski
SMT-Based Reachability Checking for Bounded Time Petri Nets. CS&P (2013)
Artur Niewiadomski, Wojciech Penczek, Agata Pólrola, Maciej Szreter, Andrzej Zbrzezny
Towards Automatic Composition of Web Services: SAT-Based Concretisation of Abstract Scenarios. Fundam. Informaticae 120 (2) (2012)
Dariusz Doliwa, Wojciech Horzelski, Mariusz Jarocki, Artur Niewiadomski, Wojciech Penczek, Agata Pólrola, Jaroslaw Skaruz
HarmonICS - a Tool for Composing Medical Services. ZEUS (2012)
Agata Janowska, Wojciech Penczek, Agata Pólrola, Andrzej Zbrzezny
Using Integer Time Steps for Checking Branching Time Properties of Time Petri Nets. PNSE (2012)
Dariusz Doliwa, Wojciech Horzelski, Mariusz Jarocki, Artur Niewiadomski, Wojciech Penczek, Agata Pólrola, Maciej Szreter, Andrzej Zbrzezny
PlanICS - a Web Service Composition Toolset. Fundam. Informaticae 112 (1) (2011)
Artur Meski, Agata Pólrola, Wojciech Penczek, Bozena Wozna-Szczesniak, Andrzej Zbrzezny
Bounded Model Checking Approaches for Verification of Distributed Time Petri Nets. PNSE (2011)
Artur Meski, Wojciech Penczek, Agata Pólrola
BDD-based Bounded Model Checking for Temporal Properties of 1-Safe Petri Nets. Fundam. Informaticae 109 (3) (2011)
Michal Knapik, Artur Niewiadomski, Wojciech Penczek, Agata Pólrola, Maciej Szreter, Andrzej Zbrzezny
Parametric Model Checking with VerICS. Trans. Petri Nets Other Model. Concurr. 4 (2010)
Wojciech Penczek, Agata Pólrola, Andrzej Zbrzezny
SAT-Based (Parametric) Reachability for a Class of Distributed Time Petri Nets. Trans. Petri Nets Other Model. Concurr. 4 (2010)
Wojciech Penczek, Agata Pólrola, Andrzej Zbrzezny
Towards Automatic Composition of Web Services: A SAT-Based Phase. ACSD/Petri Nets Workshops (2010)
Michal Knapik, Wojciech Penczek, Maciej Szreter, Agata Pólrola
Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics. Fundam. Informaticae 101 (1-2) (2010)
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. Informaticae 85 (1-4) (2008)
Andrzej Zbrzezny, Agata Pólrola
SAT-Based Reachability Checking for Timed Automata with Discrete Data. Fundam. Informaticae 79 (3-4) (2007)
Agata Pólrola, Wojciech Penczek
Minimization Algorithms for Time Petri Nets. Fundam. Informaticae 60 (1-4) (2004)
Wojciech Penczek, Agata Pólrola
Specification and Model Checking of Temporal Properties in Time Petri Nets and Timed Automata. ICATPN (2004)
Agata Pólrola, Wojciech Penczek, Maciej Szreter
Reachability Analysis for Timed Automata Using Partitioning Algorithms. Fundam. Informaticae 55 (2) (2003)
Agata Pólrola, Wojciech Penczek, Maciej Szreter
Towards Efficient Partition Refinement for Checking Reachability in Timed Automata. FORMATS (2003)
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)
Piotr Dembinski, Wojciech Penczek, Agata Pólrola
Verification of Timed Automata Based on Similarity. Fundam. Informaticae 51 (1-2) (2002)
Wojciech Penczek, Agata Pólrola
Abstractions and Partial Order Reductions for Checking Branching Properties of Time Petri Nets. ICATPN (2001)
Piotr Dembinski, Wojciech Penczek, Agata Pólrola
Automated Verification of Infinite State Concurrent Systems. PPAM (2001)