default search action
Wojciech Penczek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j76]Artur Meski, Maciej Koutny, Lukasz Mikulski, Wojciech Penczek:
Reaction mining for reaction systems. Nat. Comput. 23(2): 323-343 (2024) - [j75]Jaime Arias
, Carlos Olarte
Optimal Scheduling of Agents in ADTrees: Specialized Algorithm and Declarative Models. IEEE Trans. Reliab. 73(2): 861-875 (2024) - [c88]Artur Niewiadomski, Maciej Nazarczuk, Mateusz Przychodzki, Magdalena Kacprzak, Wojciech Penczek, Andrzej Zbrzezny:
SMT4SMTL: A Tool for SMT-Based Satisfiability Checking of SMTL. AAMAS 2024: 2815-2817 - [c87]Jaime Arias
Model Checking and Synthesis for Strategic Timed CTL using Strategies in Rewriting Logic. PPDP 2024: 10:1-10:14 - 2023
- [c86]Wojciech Penczek:
Model Checking of Strategic Timed Temporal Logics (Invited Talk). PNSE@Petri Nets 2023 - [c85]Jaime Arias, Wojciech Jamroga, Wojciech Penczek, Laure Petrucci, Teofil Sidoruk:
Strategic (Timed) Computation Tree Logic. AAMAS 2023: 382-390 - [c84]Magdalena Kacprzak
SMT-Based Satisfiability Checking of Strategic Metric Temporal Logic. ECAI 2023: 1180-1189 - [i11]Jaime Arias, Wojciech Jamroga
Strategic (Timed) Computation Tree Logic. CoRR abs/2302.13405 (2023) - [i10]Jaime Arias, Carlos Olarte, Laure Petrucci, Lukasz Masko, Wojciech Penczek, Teofil Sidoruk:
Optimal Scheduling of Agents in ADTrees: Specialised Algorithm and Declarative Models. CoRR abs/2305.04616 (2023) - [i9]Damian Kurpiewski, Wojciech Jamroga, Lukasz Masko, Lukasz Mikulski, Witold Pazderski, Wojciech Penczek, Teofil Sidoruk:
Verification of Multi-Agent Properties in Electronic Voting: A Case Study. CoRR abs/2310.15789 (2023) - [i8]Artur Niewiadomski, Magdalena Kacprzak, Damian Kurpiewski, Michal Knapik, Wojciech Penczek, Wojciech Jamroga:
MsATL: a Tool for SAT-Based ATL Satisfiability Checking. CoRR abs/2310.16519 (2023) - [i7]Wojciech Jamroga, Beata Konikowska, Damian Kurpiewski, Wojciech Penczek:
Multi-Valued Verification of Strategic Ability. CoRR abs/2310.20344 (2023) - 2022
- [c83]Wojtek Jamroga, Lukasz Masko, Lukasz Mikulski, Witold Pazderski, Wojciech Penczek, Teofil Sidoruk, Damian Kurpiewski:
Verification of Multi-Agent Properties in Electronic Voting: A Case Study. AiML 2022: 531-556 - [c82]Jaime Arias
Minimal Schedule with Minimal Number of Agents in Attack-Defence Trees. ICECCS 2022: 1-10 - [c81]Jaime Arias
Modular Analysis of Tree-Topology Models. ICFEM 2022: 36-53 - 2021
- [j74]Holger Schlingloff
Preface. Fundam. Informaticae 179(2) (2021) - [j73]Jörg Keller, Wojciech Penczek
Preface. Fundam. Informaticae 182(1) (2021) - [c80]Wojciech Jamroga, Wojciech Penczek
Strategic Abilities of Asynchronous Agents: Semantic Side Effects. AAMAS 2021: 1545-1547 - [c79]Jaime Arias, Wojciech Penczek
ADT2AMAS: Managing Agents in Attack-Defence Scenarios. AAMAS 2021: 1749-1751 - [c78]Wojciech Jamroga, Wojciech Penczek
Strategic Abilities of Asynchronous Agents: Semantic Side Effects and How to Tame Them. KR 2021: 368-378 - [c77]Magdalena Kacprzak, Artur Niewiadomski, Wojciech Penczek
Satisfiability Checking of Strategy Logic with Simple Goals. KR 2021: 400-410 - [c76]Michal Kanski
SMT-Based Unbounded Model Checking for ATL. VECoS 2021: 43-58 - [i6]Jaime Arias
Minimal Schedule with Minimal Number of Agents in Attack-Defence Trees. CoRR abs/2101.06838 (2021) - 2020
- [j72]Wojciech Jamroga
Multi-valued Verification of Strategic Ability. Fundam. Informaticae 175(1-4): 207-251 (2020) - [j71]Wojciech Jamroga
Towards Partial Order Reductions for Strategic Ability. J. Artif. Intell. Res. 68: 817-850 (2020) - [c75]Artur Niewiadomski
MsATL: A Tool for SAT-Based ATL Satisfiability Checking. AAMAS 2020: 2111-2113 - [c74]Jaime Arias
Hackers vs. Security: Attack-Defence Trees as Asynchronous Multi-agent Systems. ICFEM 2020: 3-19 - [c73]Magdalena Kacprzak
SAT-Based ATL Satisfiability Checking. KR 2020: 539-549 - [i5]Magdalena Kacprzak, Artur Niewiadomski, Wojciech Penczek:
SAT-Based ATL Satisfiability Checking. CoRR abs/2002.03117 (2020) - [i4]Wojciech Jamroga, Wojciech Penczek, Teofil Sidoruk:
Strategic Abilities of Asynchronous Agents: Semantic Paradoxes and How to Tame Them. CoRR abs/2003.03867 (2020)
2010 – 2019
- 2019
- [j70]Artur Niewiadomski
Applying Modern SAT-solvers to Solving Hard Problems. Fundam. Informaticae 165(3-4): 321-344 (2019) - [j69]Wojciech Penczek
Preface. Fundam. Informaticae 165(3-4): i-iii (2019) - [j68]Victor Khomenko, Jetty Kleijn, Wojciech Penczek, Olivier H. Roux:
Preface. Fundam. Informaticae 169(1-2): v-vi (2019) - [j67]Michal Knapik
Timed ATL: Forget Memory, Just Count. J. Artif. Intell. Res. 66: 197-223 (2019) - [j66]Étienne André
Parametric Verification: An Introduction. Trans. Petri Nets Other Model. Concurr. 14: 64-100 (2019) - [c72]Laure Petrucci
Squeezing State Spaces of (Attack-Defence) Trees. ICECCS 2019: 71-80 - [p3]Wojciech Penczek
All True Concurrency Models Start with Petri Nets: A Personal Tribute to Carl Adam Petri. Carl Adam Petri: Ideas, Personality, Impact 2019: 193-204 - [i3]Jaime Arias, Carlos E. Budde, Wojciech Penczek, Laure Petrucci, Mariëlle Stoelinga:
Hackers vs. Security: Attack-Defence Trees as Asynchronous Multi-Agent Systems. CoRR abs/1906.05283 (2019) - [i2]Étienne André, Michal Knapik, Didier Lime, Wojciech Penczek, Laure Petrucci
Parametric Verification: An Introduction. CoRR abs/1907.00555 (2019) - 2018
- [j65]Artur Niewiadomski, Piotr Switalski, Teofil Sidoruk, Wojciech Penczek:
SMT-Solvers in Action: Encoding and Solving Selected Problems in NP and EXPTIME. Sci. Ann. Comput. Sci. 28(2): 269-288 (2018) - [j64]Artur Niewiadomski
TripICS - a Web Service Composition System for Planning Trips and Travels. Fundam. Informaticae 157(4): 403-425 (2018) - [j63]Ludwik Czaja, Wojciech Penczek
Preface. Fundam. Informaticae 157(4): i-ii (2018) - [j62]Wil M. P. van der Aalst
Preface. Fundam. Informaticae 161(4): i-ii (2018) - [c71]Wojciech Jamroga, Wojciech Penczek
Towards Partial Order Reductions for Strategic Ability. AAMAS 2018: 156-165 - [c70]Wojciech Penczek:
Improving Efficiency of Model Checking for Variants of Alternating-time Temporal Logic. CS&P 2018 - [c69]Artur Meski
Reaction Mining for Reaction Systems. UCNC 2018: 131-144 - [e6]Natasha Alechina, Kjetil Nørvåg, Wojciech Penczek:
25th International Symposium on Temporal Representation and Reasoning, TIME 2018, Warsaw, Poland, October 15-17, 2018. LIPIcs 120, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-089-7 [contents] - [e5]Maciej Koutny, Lars Michael Kristensen, Wojciech Penczek:
Transactions on Petri Nets and Other Models of Concurrency XIII. Lecture Notes in Computer Science 11090, Springer 2018, ISBN 978-3-662-58380-7 [contents] - 2017
- [j61]Artur Niewiadomski
Combining ontology reductions with new approaches to automated abstract planning of Planics. Appl. Soft Comput. 53: 352-379 (2017) - [j60]Artur Meski
Verification of Linear-Time Temporal Properties for Reaction Systems with Discrete Concentrations. Fundam. Informaticae 154(1-4): 289-306 (2017) - [c68]Étienne André, Laure Petrucci, Wojciech Jamroga, Michal Knapik
Timed ATL: Forget Memory, Just Count. AAMAS 2017: 1460-1462 - [e4]Maciej Koutny, Jetty Kleijn, Wojciech Penczek
Transactions on Petri Nets and Other Models of Concurrency XII. Lecture Notes in Computer Science 10470, Springer 2017, ISBN 978-3-662-55861-4 [contents] - 2016
- [j59]Ludwik Czaja, Wojciech Penczek
Preface. Fundam. Informaticae 143(1-2): v-vi (2016) - [j58]Raymond R. Devillers, Antti Valmari, Wojciech Penczek
Preface. Fundam. Informaticae 146(1): v-vi (2016) - [j57]Artur Niewiadomski
Concrete Planning in PlanICS Framework by Combining SMT with GEO and Simulated Annealing. Fundam. Informaticae 147(2-3): 289-313 (2016) - [j56]Ludwik Czaja, Wojciech Penczek
Preface. Fundam. Informaticae 147(2-3): i-iii (2016) - [c67]Étienne André
Controlling Actions and Time in Parametric Timed Automata. ACSD 2016: 45-54 - [c66]Wojciech Jamroga, Beata Konikowska, Wojciech Penczek:
Multi-Valued Verification of Strategic Ability. AAMAS 2016: 1180-1189 - [c65]Artur Niewiadomski, Wojciech Penczek:
TripICS - a Web Service Composition System for Planning Trips and Travels (extended abstract). CS&P 2016: 171-179 - [c64]Artur Meski
Towards Quantitative Verification of Reaction Systems. UCNC 2016: 142-154 - [p2]Michal Knapik, Wojciech Penczek
SMT-Based Parameter Synthesis for Parametric Timed Automata. Challenging Problems and Solutions in Intelligent Systems 2016: 3-21 - [e3]Guy De Tré
Challenging Problems and Solutions in Intelligent Systems. Studies in Computational Intelligence 634, Springer 2016, ISBN 978-3-319-30164-8 [contents] - 2015
- [j55]Artur Meski
Model checking temporal properties of reaction systems. Inf. Sci. 313: 22-42 (2015) - [j54]Michal Knapik
Action Synthesis for Branching Time Logic: Theory and Applications. ACM Trans. Embed. Comput. Syst. 14(4): 64:1-64:23 (2015) - [j53]Artur Niewiadomski
SMT-Based Abstract Parametric Temporal Planning. Trans. Petri Nets Other Model. Concurr. 10: 55-83 (2015) - [c63]Jaroslaw Skaruz, Artur Niewiadomski, Wojciech Penczek:
Hybrid Planning by Combining SMT and Simulated Annealing. CS&P 2015: 173-176 - [c62]Michal Knapik, Artur Niewiadomski
Generating None-Plans in Order to Find Plans. SEFM 2015: 310-324 - 2014
- [j52]Artur Meski
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) - [j51]Michal Knapik
Parameter Synthesis for Timed Kripke Structures. Fundam. Informaticae 133(2-3): 211-226 (2014) - [j50]Artur Niewiadomski
SMT Versus Genetic and OpenOpt Algorithms: Concrete Planning in the PlanICS Framework. Fundam. Informaticae 135(4): 451-466 (2014) - [j49]Wojciech Penczek
Preface. Fundam. Informaticae 135(4): i (2014) - [c61]Michal Knapik
Action Synthesis for Branching Time Logic: Theory and Applications. ACSD 2014: 1-10 - [c60]Artur Niewiadomski, Wojciech Penczek:
SMT-based Abstract Temporal Planning. PNSE @ Petri Nets 2014: 55-74 - [c59]Artur Niewiadomski, Wojciech Penczek:
PlanICS 2.0 - A Tool for Composing Services. PNSE @ Petri Nets 2014: 351-352 - [c58]Michal Knapik, Wojciech Penczek
Fixed-Point Methods in Parametric Model Checking. IEEE Conf. on Intelligent Systems (1) 2014: 231-242 - [c57]Artur Niewiadomski
A Hybrid Approach to Web Service Composition Problem in the PlanICS Framework. MobiWIS 2014: 17-28 - 2013
- [j48]Lars Michael Kristensen, Wojciech Penczek
Preface. Fundam. Informaticae 122(1-2) (2013) - [j47]Agata Janowska, Wojciech Penczek
Using Integer Time Steps for Checking Branching Time Properties of Time Petri Nets. Trans. Petri Nets Other Model. Concurr. 8: 89-105 (2013) - [c56]Michal Knapik
Parameter Synthesis for Timed Kripke Structures. CS&P 2013: 259-270 - [c55]Artur Niewiadomski, Wojciech Penczek, Jaroslaw Skaruz:
SMT vs Genetic Algorithms: Concrete Planning in PlanICS Framework. CS&P 2013: 309-321 - [c54]Jaroslaw Skaruz, Artur Niewiadomski
Automated abstract planning with use of genetic algorithms. GECCO (Companion) 2013: 129-130 - [c53]Artur Niewiadomski, Wojciech Penczek:
Towards SMT-based Abstract Planning in PlanICS Ontology. KEOD 2013: 123-131 - [c52]Jaroslaw Skaruz, Artur Niewiadomski
Evolutionary Algorithms for Abstract Planning. PPAM (1) 2013: 392-401 - 2012
- [j46]Wojciech Penczek
Towards SAT-based BMC for LTLK over Interleaved Interpreted Systems. Fundam. Informaticae 119(3-4): 373-392 (2012) - [j45]Artur Niewiadomski
Towards Automatic Composition of Web Services: SAT-Based Concretisation of Abstract Scenarios. Fundam. Informaticae 120(2): 181-203 (2012) - [j44]Wojciech Penczek
Preface. Fundam. Informaticae 120(3-4) (2012) - [j43]Michal Knapik, Wojciech Penczek
Bounded Model Checking for Parametric Timed Automata. Trans. Petri Nets Other Model. Concurr. 5: 141-159 (2012) - [c51]Andrew V. Jones, Michal Knapik
Group synthesis for parametric temporal-epistemic logic. AAMAS 2012: 1107-1114 - [c50]Artur Meski, Wojciech Penczek, Maciej Szreter, Bozena Wozna-Szczesniak, Andrzej Zbrzezny:
Bounded model checking for knowledge and linear time. AAMAS 2012: 1447-1448 - [c49]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 - [c48]Michal Knapik
SMT-based parameter synthesis for L/U automata. PNSE 2012: 77-92 - [c47]Alessio Lomuscio
Symbolic Model Checking for Temporal-Epistemic Logic. Logic Programs, Norms and Action 2012: 172-195 - [c46]Artur Meski
Bounded Model Checking for Linear Time Temporal-Epistemic Logic. ICCSW 2012: 88-94 - [c45]Artur Meski
Two Approaches to Bounded Model Checking for Linear Time Logic with Knowledge. KES-AMSTA 2012: 514-523 - [c44]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 - [r1]Miroslaw Kurkowski, Wojciech Penczek:
Applying Timed Automata to Model Checking of Security Protocols. Handbook of Finite State Based Models and Applications 2012: 223-254 - 2011
- [j42]Artur Meski
BDD-based Bounded Model Checking for Temporal Properties of 1-Safe Petri Nets. Fundam. Informaticae 109(3): 305-321 (2011) - [j41]Alessio Lomuscio
Runtime Monitoring of Contract Regulated Web Services. Fundam. Informaticae 111(3): 339-355 (2011) - [j40]Dariusz Doliwa, Wojciech Horzelski
PlanICS - a Web Service Composition Toolset. Fundam. Informaticae 112(1): 47-71 (2011) - [j39]Wojciech Penczek
Preface. Fundam. Informaticae 112(1) (2011) - [j38]Johan Lilius
Preface. Fundam. Informaticae 113(3-4) (2011) - [c43]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 - [c42]Wojciech Jamroga
Specification and Verification of Multi-Agent Systems. ESSLLI 2011: 210-263 - 2010
- [j37]Michal Knapik
Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics. Fundam. Informaticae 101(1-2): 9-27 (2010) - [j36]Alessio Lomuscio
Partial Order Reductions for Model Checking Temporal-epistemic Logics over Interleaved Multi-agent Systems. Fundam. Informaticae 101(1-2): 71-90 (2010) - [j35]Wojciech Penczek
Preface. Fundam. Informaticae 102(1) (2010) - [j34]Giuliana Franceschinis, Wojciech Penczek
Preface. Fundam. Informaticae 105(3) (2010) - [j33]Michal Knapik, Maciej Szreter, Wojciech Penczek
Bounded Parametric Model Checking for Elementary Net Systems. Trans. Petri Nets Other Model. Concurr. 4: 42-71 (2010) - [j32]Wojciech Penczek
SAT-Based (Parametric) Reachability for a Class of Distributed Time Petri Nets. Trans. Petri Nets Other Model. Concurr. 4: 72-97 (2010) - [j31]Michal Knapik, Artur Niewiadomski
Parametric Model Checking with VerICS. Trans. Petri Nets Other Model. Concurr. 4: 98-120 (2010) - [c41]Michal Knapik, Wojciech Penczek:
Bounded Model Checking for Parametric Timed Automata. ACSD/Petri Nets Workshops 2010: 419-435 - [c40]Wojciech Penczek, Agata Pólrola, Andrzej Zbrzezny:
Towards Automatic Composition of Web Services: A SAT-Based Phase. ACSD/Petri Nets Workshops 2010: 453-473 - [c39]Alessio Lomuscio, Wojciech Penczek, Hongyang Qu:
Partial order reductions for model checking temporal epistemic logics over interleaved multi-agent systems. AAMAS 2010: 659-666 - [c38]Alessio Lomuscio, Monika Solanki, Wojciech Penczek, Maciej Szreter:
Runtime monitoring of contract regulated web services. AAMAS 2010: 1449-1450 - [e2]Johan Lilius, Wojciech Penczek:
Applications and Theory of Petri Nets, 31st International Conference, PETRI NETS 2010, Braga, Portugal, June 21-25, 2010. Proceedings. Lecture Notes in Computer Science 6128, Springer 2010, ISBN 978-3-642-13674-0 [contents]
2000 – 2009
- 2009
- [j30]Gizela Jakubowska, Piotr Dembinski, Wojciech Penczek
Simulation of Security Protocols based on Scenarios of Attacks. Fundam. Informaticae 93(1-3): 185-203 (2009) - [j29]Miroslaw Kurkowski
Timed Automata Based Model Checking of Timed Security Protocols. Fundam. Informaticae 93(1-3): 245-259 (2009) - [j28]Artur Niewiadomski
A New Approach to Model Checking of UML State Machines. Fundam. Informaticae 93(1-3): 289-303 (2009) - [c37]Artur Niewiadomski
Towards Checking Parametric Reachability for UML State Machines. Ershov Memorial Conference 2009: 319-330 - 2008
- [j27]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) - [j26]Alessio Lomuscio, Wojciech Penczek:
LDYIS: a Framework for Model Checking Security Protocols. Fundam. Informaticae 85(1-4): 359-375 (2008) - [j25]Wojciech Penczek, Maciej Szreter:
SAT-based Unbounded Model Checking of Timed Automata. Fundam. Informaticae 85(1-4): 425-440 (2008) - [c36]Alessio Lomuscio
Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic. MoChArt 2008: 106-121 - 2007
- [j24]Alessio Lomuscio
Bounded model checking for knowledge and real time. Artif. Intell. 171(16-17): 1011-1038 (2007) - [j23]Gizela Jakubowska, Wojciech Penczek:
Modelling and Checking Timed Authentication of Security Protocols. Fundam. Informaticae 79(3-4): 363-378 (2007) - [j22]Agata Janowska, Wojciech Penczek:
Path Compression in Timed Automata. Fundam. Informaticae 79(3-4): 379-399 (2007) - [j21]Miroslaw Kurkowski, Wojciech Penczek:
Verifying Security Protocols Modelled by Networks of Automata. Fundam. Informaticae 79(3-4): 453-471 (2007) - [j20]Alessio Lomuscio
Symbolic model checking for temporal-epistemic logics. SIGACT News 38(3): 77-99 (2007) - [c35]Wojciech Penczek
SAT-based Unbounded Model Checking of Timed Automata. ACSD 2007: 236-237 - [c34]Gizela Jakubowska, Wojciech Penczek:
Is Your Security Protocol on Time ? FSEN 2007: 65-80 - [i1]Alessio Lomuscio, Wojciech Penczek:
Logic Column 19: Symbolic Model Checking for Temporal-Epistemic Logics. CoRR abs/0709.0446 (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 - [j19]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) - [c33]Beata Konikowska
Model checking for multivalued logic of knowledge and time. AAMAS 2006: 169-176 - [c32]Miroslaw Kurkowski, Wojciech Penczek, Andrzej Zbrzezny:
SAT-Based Verification of Security Protocols Via Translation to Networks of Automata. MoChArt 2006: 146-165 - 2005
- [j18]Magdalena Kacprzak
Fully Symbolic Unbounded Model Checking for Alternating-time Temporal Logic1. Auton. Agents Multi Agent Syst. 11(1): 69-89 (2005) - [c31]Bozena Wozna
Bounded model checking for knowledge and real time. AAMAS 2005: 165-172 - 2004
- [j17]Beata Konikowska, Wojciech Penczek:
On Designated Values in Multi-valued CTL* Model Checking. Fundam. Informaticae 60(1-4): 211-224 (2004) - [j16]Agata Pólrola, Wojciech Penczek:
Minimization Algorithms for Time Petri Nets. Fundam. Informaticae 60(1-4): 307-331 (2004) - [j15]Magdalena Kacprzak, Alessio Lomuscio, Wojciech Penczek:
From Bounded to Unbounded Model Checking for Temporal Epistemic Logic. Fundam. Informaticae 63(2-3): 221-240 (2004) - [j14]Magdalena Kacprzak
A Sat-Based Approach to Unbounded Model Checking for Alternating-Time Temporal Epistemic Logic. Synth. 142(2): 203-227 (2004) - [c30]Wojciech Penczek, Agata Pólrola
Specification and Model Checking of Temporal Properties in Time Petri Nets and Timed Automata. ICATPN 2004: 37-76 - [c29]Magdalena Kacprzak, Alessio Lomuscio
Verification of Multiagent Systems via Unbounded Model Checking. AAMAS 2004: 638-645 - [c28]Magdalena Kacprzak, Wojciech Penczek:
Unbounded Model Checking for Alternating-Time Temporal Logic. AAMAS 2004: 646-653 - [c27]Magdalena Kacprzak, Alessio Lomuscio
Verifying Multi-agent Systems via Unbounded Model Checking. FAABS 2004: 189-212 - [c26]Bozena Wozna
Bounded Model Checking for Deontic Interpreted Systems. LCMAS 2004: 93-114 - 2003
- [j13]Wojciech Penczek, Alessio Lomuscio:
Verifying Epistemic Properties of Multi-agent Systems via Bounded Model Checking. Fundam. Informaticae 55(2): 167-185 (2003) - [j12]Agata Pólrola, Wojciech Penczek, Maciej Szreter:
Reachability Analysis for Timed Automata Using Partitioning Algorithms. Fundam. Informaticae 55(2): 203-221 (2003) - [j11]Bozena Wozna, Andrzej Zbrzezny, Wojciech Penczek:
Checking Reachability Properties for Timed Automata via SAT. Fundam. Informaticae 55(2): 223-241 (2003) - [c25]Wojciech Penczek, Alessio Lomuscio
Verifying epistemic properties of multi-agent systems via bounded model checking. AAMAS 2003: 209-216 - [c24]Agata Pólrola
Towards Efficient Partition Refinement for Checking Reachability in Timed Automata. FORMATS 2003: 2-17 - [c23]Piotr Dembinski, Agata Janowska, Pawel Janowski, Wojciech Penczek, Agata Pólrola
Verics: A Tool for Verifying Timed Automata and Estelle Specifications. TACAS 2003: 278-283 - 2002
- [j10]Piotr Dembinski, Wojciech Penczek, Agata Pólrola:
Verification of Timed Automata Based on Similarity. Fundam. Informaticae 51(1-2): 59-89 (2002) - [j9]Wojciech Penczek, Bozena Wozna, Andrzej Zbrzezny:
Bounded Model Checking for the Universal Fragment of CTL. Fundam. Informaticae 51(1-2): 135-156 (2002) - [c22]Beata Konikowska, Wojciech Penczek:
Reducing Model Checking from Multi-valued {\rm CTL}^{\ast} to {\rm CTL}^{\ast}. CONCUR 2002: 226-239 - [c21]Alessio Lomuscio
Bounded Model Checking for Interpreted Systems: Preliminary Experimental Results. FAABS 2002: 115-125 - [c20]Wojciech Penczek, Bozena Wozna
Towards Bounded Model Checking for the Universal Fragment of TCTL. FTRTFT 2002: 265-290 - [c19]Henri Hansen
Stuttering-Insensitive Automata for On-the-fly Detection of Livelock Properties. FMICS 2002: 178-193 - 2001
- [c18]Wojciech Penczek, Agata Pólrola
Abstractions and Partial Order Reductions for Checking Branching Properties of Time Petri Nets. ICATPN 2001: 323-342 - [c17]Wojciech Penczek:
Efficient Model Checking of Causal-Knowledge Protocols. CEEMAS 2001: 242-252 - [c16]Piotr Dembinski, Wojciech Penczek, Agata Pólrola
Automated Verification of Infinite State Concurrent Systems. PPAM 2001: 247-255 - 2000
- [j8]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) - [j7]Wojciech Penczek:
Temporal Approach to Causal Knowledge. Log. J. IGPL 8(1): 87-99 (2000) - [c15]Stanislaw Ambroszkiewicz
Towards Formal Specification and Verification in Cyberspace. FAABS 2000: 16-32 - [c14]Stanislaw Ambroszkiewicz, Krzysztof Cetnarowicz, Jaroslaw Kozlak, Tomasz Nowak, Wojciech Penczek:
Modeling Agent Organizations. Intelligent Information Systems 2000: 135-144
1990 – 1999
- 1999
- [j6]Rob Gerth, Ruurd Kuiper, Doron A. Peled, Wojciech Penczek
A Partial Order Approach to Branching Time Logic Model Checking. Inf. Comput. 150(2): 132-152 (1999) - [c13]Stanislaw Ambroszkiewicz, Wojciech Penczek:
Local Interactions, Explicit Communication and Causal Knowledge in Games and Multi-Agent Systems. CEEMAS 1999 - [c12]Wojciech Penczek
Model checking of causal knowledge formulas. WDS@FCT 1999: 40-58 - 1998
- [c11]Stanislaw Ambroszkiewicz
Team Formation by Self-Interested Mobile Agents. DAI 1998: 1-15 - 1997
- [c10]Wojciech Penczek
Model-Checking for a Subclass of Event Structures. TACAS 1997: 145-164 - 1996
- [j5]Wojciech Penczek:
Axiomatizations of Temporal Logics on Trace Systems. Fundam. Informaticae 25(2): 183-200 (1996) - [c9]Wojciech Penczek, Marian Srebrny:
A complete axiomatization of a first-order temporal logic over trace systems. Partial Order Methods in Verification 1996: 79-97 - [e1]Wojciech Penczek, Andrzej Szalas:
Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings. Lecture Notes in Computer Science 1113, Springer 1996, ISBN 3-540-61550-4 [contents] - 1995
- [c8]Rob Gerth, Ruurd Kuiper, Doron A. Peled, Wojciech Penczek
A Partial Order Approach to Branching Time Logic Model Checking. ISTCS 1995: 130-139 - [c7]Rajeev Alur, Doron A. Peled, Wojciech Penczek:
Model-Checking of Causality Properties. LICS 1995: 90-100 - [c6]Doron A. Peled, Wojciech Penczek:
Using asynchronous Büchi automata for efficient automatic verification of concurrent systems. PSTV 1995: 315-330 - [p1]Wojciech Penczek, Ruurd Kuiper:
Traces and Logic. The Book of Traces 1995: 307-390 - 1994
- [c5]Marta Z. Kwiatkowska, Doron A. Peled, Wojciech Penczek:
A Hierarchy of Partial Order Temporal Properties. ICTL 1994: 398-414 - 1993
- [j4]Wojciech Penczek:
Temporal Logics for Trace Systems: On Automated Verification. Int. J. Found. Comput. Sci. 4(1): 31-67 (1993) - [c4]Wojciech Penczek:
Axiomatizations of Temporal Logics on Trace Systems. STACS 1993: 452-462 - 1992
- [j3]Wojciech Penczek
On Undecidability of Propositional Temporal Logics on Trace Systems. Inf. Process. Lett. 43(3): 147-153 (1992) - [c3]Ursula Goltz, Ruurd Kuiper, Wojciech Penczek:
Propositional Temporal Logics and Equivalences. CONCUR 1992: 222-236 - 1990
- [j2]Edward Ochmanski, Wojciech Penczek:
Inevitability in diamond processes. RAIRO Theor. Informatics Appl. 24: 37-46 (1990)
1980 – 1989
- 1989
- [j1]Antoni W. Mazurkiewicz, Edward Ochmanski, Wojciech Penczek
Concurrent Systems and Inevitability. Theor. Comput. Sci. 64(3): 281-304 (1989) - [c2]Wojciech Penczek
A Concurrent Branching Time Temporal Logic. CSL 1989: 337-354 - [c1]Wojciech Penczek:
A Temporal Logic for the Local Specification of Concurrent Systems. IFIP Congress 1989: 857-862
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-10-23 20:32 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: