default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAgata Pólrola
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j14]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: 352-379 (2017)- 2014
- [j13]Agata Pólrola, Piotr Cybula, Artur Meski:
SMT-Based Reachability Checking for Bounded Time Petri Nets. Fundam. Informaticae 135(4): 467-482 (2014) - 2013
- [j12]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: 89-105 (2013) - [c10]Agata Pólrola, Piotr Cybula, Artur Meski:
SMT-Based Reachability Checking for Bounded Time Petri Nets. CS&P 2013: 332-341 - 2012
- [j11]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): 181-203 (2012) - [c9]Agata Janowska, Wojciech Penczek, Agata Pólrola, Andrzej Zbrzezny:
Using Integer Time Steps for Checking Branching Time Properties of Time Petri Nets. PNSE 2012: 15-31 - [c8]Dariusz Doliwa, Wojciech Horzelski, Mariusz Jarocki, Artur Niewiadomski, Wojciech Penczek, Agata Pólrola, Jaroslaw Skaruz:
HarmonICS - a Tool for Composing Medical Services. ZEUS 2012: 25-33 - 2011
- [j10]Artur Meski, Wojciech Penczek, Agata Pólrola:
BDD-based Bounded Model Checking for Temporal Properties of 1-Safe Petri Nets. Fundam. Informaticae 109(3): 305-321 (2011) - [j9]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): 47-71 (2011) - [c7]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: 72-91 - 2010
- [j8]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): 9-27 (2010) - [j7]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: 72-97 (2010) - [j6]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: 98-120 (2010) - [c6]Wojciech Penczek, Agata Pólrola, Andrzej Zbrzezny:
Towards Automatic Composition of Web Services: A SAT-Based Phase. ACSD/Petri Nets Workshops 2010: 453-473
2000 – 2009
- 2008
- [j5]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): 313-328 (2008) - 2007
- [j4]Andrzej Zbrzezny, Agata Pólrola:
SAT-Based Reachability Checking for Timed Automata with Discrete Data. Fundam. Informaticae 79(3-4): 579-593 (2007) - 2006
- [b1]Wojciech Penczek, Agata Pólrola:
Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach. Studies in Computational Intelligence 20, Springer 2006, ISBN 978-3-540-32869-8 - 2004
- [j3]Agata Pólrola, Wojciech Penczek:
Minimization Algorithms for Time Petri Nets. Fundam. Informaticae 60(1-4): 307-331 (2004) - [c5]Wojciech Penczek, Agata Pólrola:
Specification and Model Checking of Temporal Properties in Time Petri Nets and Timed Automata. ICATPN 2004: 37-76 - 2003
- [j2]Agata Pólrola, Wojciech Penczek, Maciej Szreter:
Reachability Analysis for Timed Automata Using Partitioning Algorithms. Fundam. Informaticae 55(2): 203-221 (2003) - [c4]Agata Pólrola, Wojciech Penczek, Maciej Szreter:
Towards Efficient Partition Refinement for Checking Reachability in Timed Automata. FORMATS 2003: 2-17 - [c3]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 - 2002
- [j1]Piotr Dembinski, Wojciech Penczek, Agata Pólrola:
Verification of Timed Automata Based on Similarity. Fundam. Informaticae 51(1-2): 59-89 (2002) - 2001
- [c2]Wojciech Penczek, Agata Pólrola:
Abstractions and Partial Order Reductions for Checking Branching Properties of Time Petri Nets. ICATPN 2001: 323-342 - [c1]Piotr Dembinski, Wojciech Penczek, Agata Pólrola:
Automated Verification of Infinite State Concurrent Systems. PPAM 2001: 247-255
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
