Agata Pólrola

According to our database, Agata Pólrola authored at least 23 papers between 2001 and 2017.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2017

Combining ontology reductions with new approaches to automated abstract planning of Planics.

Artur Niewiadomski, Wojciech Penczek, Jaroslaw Skaruz, Maciej Szreter, Agata Pólrola

Appl. Soft Comput., 2017

2014

SMT-Based Reachability Checking for Bounded Time Petri Nets.

Agata Pólrola, Piotr Cybula, Artur Meski

Fundam. Informaticae, 2014

2013

Using Integer Time Steps for Checking Branching Time Properties of Time Petri Nets.

Agata Janowska, Wojciech Penczek, Agata Pólrola, Andrzej Zbrzezny

Trans. Petri Nets Other Model. Concurr., 2013

2012

Towards Automatic Composition of Web Services: SAT-Based Concretisation of Abstract Scenarios.

Artur Niewiadomski, Wojciech Penczek, Agata Pólrola, Maciej Szreter, Andrzej Zbrzezny

Fundam. Informaticae, 2012

HarmonICS - a Tool for Composing Medical Services.

Dariusz Doliwa, Wojciech Horzelski, Mariusz Jarocki, Artur Niewiadomski, Wojciech Penczek, Agata Pólrola, Jaroslaw Skaruz

Proceedings of the 4^th Central-European Workshop on Services and their Composition, 2012

2011

BDD-based Bounded Model Checking for Temporal Properties of 1-Safe Petri Nets.

Artur Meski, Wojciech Penczek, Agata Pólrola

Fundam. Informaticae, 2011

PlanICS - a Web Service Composition Toolset.

Dariusz Doliwa, Wojciech Horzelski, Mariusz Jarocki, Artur Niewiadomski, Wojciech Penczek, Agata Pólrola, Maciej Szreter, Andrzej Zbrzezny

Fundam. Informaticae, 2011

Bounded Model Checking Approaches for Verification of Distributed Time Petri Nets.

Artur Meski, Agata Pólrola, Wojciech Penczek, Bozena Wozna-Szczesniak, Andrzej Zbrzezny

Proceedings of the International Workshop on Petri Nets and Software Engineering, 2011

2010

SAT-Based (Parametric) Reachability for a Class of Distributed Time Petri Nets.

Wojciech Penczek, Agata Pólrola, Andrzej Zbrzezny

Trans. Petri Nets Other Model. Concurr., 2010

Parametric Model Checking with VerICS.

Michal Knapik, Artur Niewiadomski, Wojciech Penczek, Agata Pólrola, Maciej Szreter, Andrzej Zbrzezny

Trans. Petri Nets Other Model. Concurr., 2010

Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics.

Michal Knapik, Wojciech Penczek, Maciej Szreter, Agata Pólrola

Fundam. Informaticae, 2010

Towards Automatic Composition of Web Services: A SAT-Based Phase.

Wojciech Penczek, Agata Pólrola, Andrzej Zbrzezny

Proceedings of the Workshops of the 31st International Conference on Application and Theory of Petri Nets and Other Models of Concurrency (PETRI NETS 2010) and of the 10th International Conference on Application of Concurrency to System Design (ACSD 2010), 2010

2008

VerICS 2007 - a Model Checker for Knowledge and Real-Time.

Magdalena Kacprzak, Wojciech Nabialek, Artur Niewiadomski, Wojciech Penczek, Agata Pólrola, Maciej Szreter, Bozena Wozna, Andrzej Zbrzezny

Fundam. Informaticae, 2008

2007

SAT-Based Reachability Checking for Timed Automata with Discrete Data.

Andrzej Zbrzezny, Agata Pólrola

Fundam. Informaticae, 2007

2006

Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach.

Wojciech Penczek, Agata Pólrola

Studies in Computational Intelligence 20, Springer, ISBN: 978-3-540-32869-8, 2006

2004

Minimization Algorithms for Time Petri Nets.

Agata Pólrola, Wojciech Penczek

Fundam. Informaticae, 2004

Specification and Model Checking of Temporal Properties in Time Petri Nets and Timed Automata.

Wojciech Penczek, Agata Pólrola

Proceedings of the Applications and Theory of Petri Nets 2004, 2004

2003

Reachability Analysis for Timed Automata Using Partitioning Algorithms.

Agata Pólrola, Wojciech Penczek, Maciej Szreter

Fundam. Informaticae, 2003

Verics: A Tool for Verifying Timed Automata and Estelle Specifications.

Piotr Dembinski, Agata Janowska, Pawel Janowski, Wojciech Penczek, Agata Pólrola, Maciej Szreter, Bozena Wozna, Andrzej Zbrzezny

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2003

Towards Efficient Partition Refinement for Checking Reachability in Timed Automata.

Agata Pólrola, Wojciech Penczek, Maciej Szreter

Proceedings of the Formal Modeling and Analysis of Timed Systems: First International Workshop, 2003

2002

Verification of Timed Automata Based on Similarity.

Piotr Dembinski, Wojciech Penczek, Agata Pólrola

Fundam. Informaticae, 2002

2001

Automated Verification of Infinite State Concurrent Systems.

Piotr Dembinski, Wojciech Penczek, Agata Pólrola

Proceedings of the Parallel Processing and Applied Mathematics, 2001

Abstractions and Partial Order Reductions for Checking Branching Properties of Time Petri Nets.

Wojciech Penczek, Agata Pólrola

Proceedings of the Application and Theory of Petri Nets 2001, 2001