default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaciej Szreter
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j16]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)- 2016
- [c13]Maciej Szreter:
A Graph-based Reduction in Planics Abstract Planning, Based on Partial Orders of Services (extended abstract). CS&P 2016: 165-170 - 2015
- [c12]Maciej Szreter:
Automated Two-Phase Composition of Timed Web Services. Ershov Memorial Conference 2015: 260-275 - 2014
- [j15]Artur Meski, Wojciech Penczek, Maciej Szreter, Bozena Wozna-Szczesniak, Andrzej Zbrzezny:
BDD-versus SAT-based bounded model checking for the existential fragment of linear temporal logic with knowledge: algorithms and their performance. Auton. Agents Multi Agent Syst. 28(4): 558-604 (2014) - [j14]Artur Niewiadomski, Jaroslaw Skaruz, Wojciech Penczek, Maciej Szreter, Mariusz Jarocki:
SMT Versus Genetic and OpenOpt Algorithms: Concrete Planning in the PlanICS Framework. Fundam. Informaticae 135(4): 451-466 (2014) - 2013
- [c11]Wojciech Jamroga, Artur Meski, Maciej Szreter:
Modularity and Openness in Modeling Multi-Agent Systems. GandALF 2013: 224-239 - 2012
- [j13]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) - [c10]Artur Meski, Wojciech Penczek, Maciej Szreter, Bozena Wozna-Szczesniak, Andrzej Zbrzezny:
Bounded model checking for knowledge and linear time. AAMAS 2012: 1447-1448 - [c9]Artur Meski, Wojciech Penczek, Maciej Szreter:
Bounded Model Checking for Linear Time Temporal-Epistemic Logic. ICCSW 2012: 88-94 - [c8]Artur Meski, Wojciech Penczek, Maciej Szreter, Bozena Wozna-Szczesniak, Andrzej Zbrzezny:
Two Approaches to Bounded Model Checking for Linear Time Logic with Knowledge. KES-AMSTA 2012: 514-523 - 2011
- [j12]Alessio Lomuscio, Wojciech Penczek, Monika Solanki, Maciej Szreter:
Runtime Monitoring of Contract Regulated Web Services. Fundam. Informaticae 111(3): 339-355 (2011) - [j11]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) - 2010
- [j10]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) - [j9]Michal Knapik, Maciej Szreter, Wojciech Penczek:
Bounded Parametric Model Checking for Elementary Net Systems. Trans. Petri Nets Other Model. Concurr. 4: 42-71 (2010) - [j8]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) - [c7]Alessio Lomuscio, Monika Solanki, Wojciech Penczek, Maciej Szreter:
Runtime monitoring of contract regulated web services. AAMAS 2010: 1449-1450
2000 – 2009
- 2009
- [j7]Gizela Jakubowska, Piotr Dembinski, Wojciech Penczek, Maciej Szreter:
Simulation of Security Protocols based on Scenarios of Attacks. Fundam. Informaticae 93(1-3): 185-203 (2009) - [j6]Artur Niewiadomski, Wojciech Penczek, Maciej Szreter:
A New Approach to Model Checking of UML State Machines. Fundam. Informaticae 93(1-3): 289-303 (2009) - [c6]Artur Niewiadomski, Wojciech Penczek, Maciej Szreter:
Towards Checking Parametric Reachability for UML State Machines. Ershov Memorial Conference 2009: 319-330 - 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) - [j4]Wojciech Penczek, Maciej Szreter:
SAT-based Unbounded Model Checking of Timed Automata. Fundam. Informaticae 85(1-4): 425-440 (2008) - 2007
- [c5]Wojciech Penczek, Maciej Szreter:
SAT-based Unbounded Model Checking of Timed Automata. ACSD 2007: 236-237 - 2006
- [j3]Magdalena Kacprzak, Alessio Lomuscio, Artur Niewiadomski, Wojciech Penczek, Franco Raimondi, Maciej Szreter:
Comparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol. Fundam. Informaticae 72(1-3): 215-234 (2006) - 2005
- [c4]Maciej Szreter:
Selective Search in Bounded Model Checking of Reachability Properties. ATVA 2005: 159-173 - 2004
- [c3]Magdalena Kacprzak, Alessio Lomuscio, T. Lasica, Wojciech Penczek, Maciej Szreter:
Verifying Multi-agent Systems via Unbounded Model Checking. FAABS 2004: 189-212 - 2003
- [j2]Agata Pólrola, Wojciech Penczek, Maciej Szreter:
Reachability Analysis for Timed Automata Using Partitioning Algorithms. Fundam. Informaticae 55(2): 203-221 (2003) - [c2]Agata Pólrola, Wojciech Penczek, Maciej Szreter:
Towards Efficient Partition Refinement for Checking Reachability in Timed Automata. FORMATS 2003: 2-17 - [c1]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 - 2000
- [j1]Wojciech Penczek, Maciej Szreter, Rob Gerth, Ruurd Kuiper:
Improving Partial Order Reductions for Universal Branching Time Properties. Fundam. Informaticae 43(1-4): 245-267 (2000)
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:52 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:
