A Concurrent Branching Time Temporal Logic. - Wojciech Penczek (CSL, 1989)

A Temporal Logic for the Local Specification of Concurrent Systems. - Wojciech Penczek (IFIP Congress, 1989)

Concurrent Systems and Inevitability. - Antoni W. Mazurkiewicz; Edward Ochmanski; Wojciech Penczek (Theor. Comput. Sci., 1989)

Inevitability in diamond processes. - Edward Ochmanski; Wojciech Penczek (RAIRO Theor. Informatics Appl., 1990)

Propositional Temporal Logics and Equivalences. - Ursula Goltz; Ruurd Kuiper 001; Wojciech Penczek (CONCUR, 1992)

On Undecidability of Propositional Temporal Logics on Trace Systems. - Wojciech Penczek (Inf. Process. Lett., 1992)

Temporal Logics for Trace Systems: On Automated Verification. - Wojciech Penczek (Int. J. Found. Comput. Sci., 1993)

A Hierarchy of Partial Order Temporal Properties. - Marta Z. Kwiatkowska; Doron A. Peled; Wojciech Penczek (ICTL, 1994)

Traces and Logic. - Wojciech Penczek; Ruurd Kuiper 001 (The Book of Traces, 1995)

Model-Checking of Causality Properties - Rajeev Alur; Doron A. Peled; Wojciech Penczek (LICS, 1995)

Using asynchronous Büchi automata for efficient automatic verification of concurrent systems. - Doron A. Peled; Wojciech Penczek (PSTV, 1995)

A complete axiomatization of a first-order temporal logic over trace systems. - Wojciech Penczek; Marian Srebrny (Partial Order Methods in Verification, 1996)

Axiomatizations of Temporal Logics on Trace Systems. - Wojciech Penczek (Fundam. Informaticae, 1996)

Model-Checking for a Subclass of Event Structures. - Wojciech Penczek (TACAS, 1997)

Team Formation by Self-Interested Mobile Agents. - Stanislaw Ambroszkiewicz; Olaf Matyja; Wojciech Penczek (DAI, 1998)

Local Interactions, Explicit Communication and Causal Knowledge in Games and Multi-Agent Systems. - Stanislaw Ambroszkiewicz; Wojciech Penczek (CEEMAS, 1999)

Model checking of causal knowledge formulas. - Wojciech Penczek; Stanislaw Ambroszkiewicz (WDS@FCT, 1999)

A Partial Order Approach to Branching Time Logic Model Checking. - Rob Gerth; Ruurd Kuiper 001; Doron A. Peled; Wojciech Penczek (Inf. Comput., 1999)

Towards Formal Specification and Verification in Cyberspace. - Stanislaw Ambroszkiewicz; Wojciech Penczek; Tomasz Nowak (FAABS, 2000)

Modeling Agent Organizations. - Stanislaw Ambroszkiewicz; Krzysztof Cetnarowicz; Jaroslaw Kozlak; Tomasz Nowak; Wojciech Penczek (Intelligent Information Systems, 2000)

Improving Partial Order Reductions for Universal Branching Time Properties. - Wojciech Penczek; Maciej Szreter; Rob Gerth; Ruurd Kuiper 001 (Fundam. Informaticae, 2000)

Temporal Approach to Causal Knowledge. - Wojciech Penczek (Log. J. IGPL, 2000)

Abstractions and Partial Order Reductions for Checking Branching Properties of Time Petri Nets. - Wojciech Penczek; Agata Pólrola (ICATPN, 2001)

Efficient Model Checking of Causal-Knowledge Protocols. - Wojciech Penczek (CEEMAS, 2001)

Automated Verification of Infinite State Concurrent Systems. - Piotr Dembinski; Wojciech Penczek; Agata Pólrola (PPAM, 2001)

Reducing Model Checking from Multi-valued { rm CTL}^{ ast} to { rm CTL}^{ ast}. - Beata Konikowska; Wojciech Penczek (CONCUR, 2002)

Bounded Model Checking for Interpreted Systems: Preliminary Experimental Results. - Alessio Lomuscio; T. Lasica; Wojciech Penczek (FAABS, 2002)

Towards Bounded Model Checking for the Universal Fragment of TCTL. - Wojciech Penczek; Bozena Wozna; Andrzej Zbrzezny (FTRTFT, 2002)

Stuttering-Insensitive Automata for On-the-fly Detection of Livelock Properties. - Henri Hansen; Wojciech Penczek; Antti Valmari (FMICS, 2002)

Verification of Timed Automata Based on Similarity. - Piotr Dembinski; Wojciech Penczek; Agata Pólrola (Fundam. Informaticae, 2002)

Bounded Model Checking for the Universal Fragment of CTL. - Wojciech Penczek; Bozena Wozna; Andrzej Zbrzezny (Fundam. Informaticae, 2002)

Towards Efficient Partition Refinement for Checking Reachability in Timed Automata. - Agata Pólrola; Wojciech Penczek; Maciej Szreter (FORMATS, 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 (TACAS, 2003)

Verifying Epistemic Properties of Multi-agent Systems via Bounded Model Checking. - Wojciech Penczek; Alessio Lomuscio (Fundam. Informaticae, 2003)

Reachability Analysis for Timed Automata Using Partitioning Algorithms. - Agata Pólrola; Wojciech Penczek; Maciej Szreter (Fundam. Informaticae, 2003)

Checking Reachability Properties for Timed Automata via SAT. - Bozena Wozna; Andrzej Zbrzezny; Wojciech Penczek (Fundam. Informaticae, 2003)

Specification and Model Checking of Temporal Properties in Time Petri Nets and Timed Automata. - Wojciech Penczek; Agata Pólrola (ICATPN, 2004)

Verification of Multiagent Systems via Unbounded Model Checking. - Magdalena Kacprzak; Alessio Lomuscio; Wojciech Penczek (AAMAS, 2004)

Unbounded Model Checking for Alternating-Time Temporal Logic. - Magdalena Kacprzak; Wojciech Penczek (AAMAS, 2004)

Verifying Multi-agent Systems via Unbounded Model Checking. - Magdalena Kacprzak; Alessio Lomuscio; T. Lasica; Wojciech Penczek; Maciej Szreter (FAABS, 2004)

Bounded Model Checking for Deontic Interpreted Systems. - Bozena Wozna; Alessio Lomuscio; Wojciech Penczek (LCMAS, 2004)

From Bounded to Unbounded Model Checking for Temporal Epistemic Logic. - Magdalena Kacprzak; Alessio Lomuscio; Wojciech Penczek (Fundam. Informaticae, 2004)

On Designated Values in Multi-valued CTL* Model Checking. - Beata Konikowska; Wojciech Penczek (Fundam. Informaticae, 2004)

Minimization Algorithms for Time Petri Nets. - Agata Pólrola; Wojciech Penczek (Fundam. Informaticae, 2004)

A Sat-Based Approach to Unbounded Model Checking for Alternating-Time Temporal Epistemic Logic. - Magdalena Kacprzak; Wojciech Penczek (Synth., 2004)

Fully Symbolic Unbounded Model Checking for Alternating-time Temporal Logic1. - Magdalena Kacprzak; Wojciech Penczek (Auton. Agents Multi Agent Syst., 2005)

Model checking for multivalued logic of knowledge and time. - Beata Konikowska; Wojciech Penczek (AAMAS, 2006)

SAT-Based Verification of Security Protocols Via Translation to Networks of Automata. - Miroslaw Kurkowski; Wojciech Penczek; Andrzej Zbrzezny (MoChArt, 2006)

Comparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol. - Magdalena Kacprzak; Alessio Lomuscio; Artur Niewiadomski 001; Wojciech Penczek; Franco Raimondi; Maciej Szreter (Fundam. Informaticae, 2006)

Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach. - Wojciech Penczek; Agata Pólrola (Springer, 2006)

Is Your Security Protocol on Time ? - Gizela Jakubowska; Wojciech Penczek (FSEN, 2007)

Bounded model checking for knowledge and real time. - Alessio Lomuscio; Wojciech Penczek; Bozena Wozna (Artif. Intell., 2007)

Logic Column 19: Symbolic Model Checking for Temporal-Epistemic Logics - Alessio Lomuscio; Wojciech Penczek (CoRR, 2007)

Modelling and Checking Timed Authentication of Security Protocols. - Gizela Jakubowska; Wojciech Penczek (Fundam. Informaticae, 2007)

Path Compression in Timed Automata. - Agata Janowska; Wojciech Penczek (Fundam. Informaticae, 2007)

Verifying Security Protocols Modelled by Networks of Automata. - Miroslaw Kurkowski; Wojciech Penczek (Fundam. Informaticae, 2007)

Symbolic model checking for temporal-epistemic logics. - Alessio Lomuscio; Wojciech Penczek (SIGACT News, 2007)

Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic. - Alessio Lomuscio; Wojciech Penczek; Hongyang Qu 001 (MoChArt, 2008)

VerICS 2007 - a Model Checker for Knowledge and Real-Time. - Magdalena Kacprzak; Wojciech Nabialek; Artur Niewiadomski 001; Wojciech Penczek; Agata Pólrola; Maciej Szreter; Bozena Wozna; Andrzej Zbrzezny (Fundam. Informaticae, 2008)

LDYIS: a Framework for Model Checking Security Protocols. - Alessio Lomuscio; Wojciech Penczek (Fundam. Informaticae, 2008)

SAT-based Unbounded Model Checking of Timed Automata. - Wojciech Penczek; Maciej Szreter (Fundam. Informaticae, 2008)

Towards Checking Parametric Reachability for UML State Machines. - Artur Niewiadomski 001; Wojciech Penczek; Maciej Szreter (Ershov Memorial Conference, 2009)

Simulation of Security Protocols based on Scenarios of Attacks. - Gizela Jakubowska; Piotr Dembinski; Wojciech Penczek; Maciej Szreter (Fundam. Informaticae, 2009)

Timed Automata Based Model Checking of Timed Security Protocols. - Miroslaw Kurkowski; Wojciech Penczek (Fundam. Informaticae, 2009)

A New Approach to Model Checking of UML State Machines. - Artur Niewiadomski 001; Wojciech Penczek; Maciej Szreter (Fundam. Informaticae, 2009)

Towards Automatic Composition of Web Services: A SAT-Based Phase. - Wojciech Penczek; Agata Pólrola; Andrzej Zbrzezny (ACSD/Petri Nets Workshops, 2010)

Preface. - Giuliana Franceschinis; Wojciech Penczek; Karsten Wolf (Fundam. Informaticae, 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)

Partial Order Reductions for Model Checking Temporal-epistemic Logics over Interleaved Multi-agent Systems. - Alessio Lomuscio; Wojciech Penczek; Hongyang Qu 001 (Fundam. Informaticae, 2010)

Preface. - Wojciech Penczek (Fundam. Informaticae, 2010)

Parametric Model Checking with VerICS. - Michal Knapik; Artur Niewiadomski 001; Wojciech Penczek; Agata Pólrola; Maciej Szreter; Andrzej Zbrzezny (Trans. Petri Nets Other Model. Concurr., 2010)

Bounded Parametric Model Checking for Elementary Net Systems. - Michal Knapik; Maciej Szreter; Wojciech Penczek (Trans. Petri Nets Other Model. Concurr., 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)

Bounded Model Checking Approaches for Verification of Distributed Time Petri Nets. - Artur Meski; Agata Pólrola; Wojciech Penczek; Bozena Wozna-Szczesniak; Andrzej Zbrzezny (PNSE, 2011)

Specification and Verification of Multi-Agent Systems. - Wojciech Jamroga; Wojciech Penczek (ESSLLI, 2011)

PlanICS - a Web Service Composition Toolset. - Dariusz Doliwa; Wojciech Horzelski; Mariusz Jarocki; Artur Niewiadomski 001; Wojciech Penczek; Agata Pólrola; Maciej Szreter; Andrzej Zbrzezny (Fundam. Informaticae, 2011)

Preface. - Johan Lilius; Wojciech Penczek (Fundam. Informaticae, 2011)

Runtime Monitoring of Contract Regulated Web Services. - Alessio Lomuscio; Wojciech Penczek; Monika Solanki; Maciej Szreter (Fundam. Informaticae, 2011)

BDD-based Bounded Model Checking for Temporal Properties of 1-Safe Petri Nets. - Artur Meski; Wojciech Penczek; Agata Pólrola (Fundam. Informaticae, 2011)

Group synthesis for parametric temporal-epistemic logic. - Andrew V. Jones; Michal Knapik; Wojciech Penczek; Alessio Lomuscio (AAMAS, 2012)

Bounded model checking for knowledge and linear time. - Artur Meski; Wojciech Penczek; Maciej Szreter; Bozena Wozna-Szczesniak; Andrzej Zbrzezny (AAMAS, 2012)

SMT-based parameter synthesis for L/U automata. - Michal Knapik; Wojciech Penczek (PNSE, 2012)

Symbolic Model Checking for Temporal-Epistemic Logic. - Alessio Lomuscio; Wojciech Penczek (Logic Programs, Norms and Action, 2012)

Bounded Model Checking for Linear Time Temporal-Epistemic Logic. - Artur Meski; Wojciech Penczek; Maciej Szreter (ICCSW, 2012)

Two Approaches to Bounded Model Checking for Linear Time Logic with Knowledge. - Artur Meski; Wojciech Penczek; Maciej Szreter; Bozena Wozna-Szczesniak; Andrzej Zbrzezny (KES-AMSTA, 2012)

HarmonICS - a Tool for Composing Medical Services. - Dariusz Doliwa; Wojciech Horzelski; Mariusz Jarocki; Artur Niewiadomski 001; Wojciech Penczek; Agata Pólrola; Jaroslaw Skaruz (ZEUS, 2012)

Towards Automatic Composition of Web Services: SAT-Based Concretisation of Abstract Scenarios. - Artur Niewiadomski 001; Wojciech Penczek; Agata Pólrola; Maciej Szreter; Andrzej Zbrzezny (Fundam. Informaticae, 2012)

Towards SAT-based BMC for LTLK over Interleaved Interpreted Systems. - Wojciech Penczek; Bozena Wozna-Szczesniak; Andrzej Zbrzezny (Fundam. Informaticae, 2012)

Bounded Model Checking for Parametric Timed Automata. - Michal Knapik; Wojciech Penczek (Trans. Petri Nets Other Model. Concurr., 2012)

Applying Timed Automata to Model Checking of Security Protocols. - Miroslaw Kurkowski; Wojciech Penczek (Handbook of Finite State Based Models and Applications, 2012)

SMT vs Genetic Algorithms: Concrete Planning in PlanICS Framework. - Artur Niewiadomski 001; Wojciech Penczek; Jaroslaw Skaruz (CS&P, 2013)

Automated abstract planning with use of genetic algorithms. - Jaroslaw Skaruz; Artur Niewiadomski 001; Wojciech Penczek (GECCO (Companion), 2013)

Towards SMT-based Abstract Planning in PlanICS Ontology. - Artur Niewiadomski 001; Wojciech Penczek (KEOD, 2013)

Evolutionary Algorithms for Abstract Planning. - Jaroslaw Skaruz; Artur Niewiadomski 001; Wojciech Penczek (PPAM (1), 2013)

Preface. - Lars Michael Kristensen; Wojciech Penczek; Laure Petrucci (Fundam. Informaticae, 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)

SMT-based Abstract Temporal Planning. - Artur Niewiadomski 001; Wojciech Penczek (PNSE @ Petri Nets, 2014)

PlanICS 2.0 - A Tool for Composing Services. - Artur Niewiadomski 001; Wojciech Penczek (PNSE @ Petri Nets, 2014)

Fixed-Point Methods in Parametric Model Checking. - Michal Knapik; Wojciech Penczek (IEEE Conf. on Intelligent Systems (1), 2014)

A Hybrid Approach to Web Service Composition Problem in the PlanICS Framework. - Artur Niewiadomski 001; Wojciech Penczek; Jaroslaw Skaruz (MobiWIS, 2014)

BDD-versus SAT-based bounded model checking for the existential fragment of linear temporal logic with knowledge: algorithms and their performance. - Artur Meski; Wojciech Penczek; Maciej Szreter; Bozena Wozna-Szczesniak; Andrzej Zbrzezny (Auton. Agents Multi Agent Syst., 2014)

Parameter Synthesis for Timed Kripke Structures. - Michal Knapik; Wojciech Penczek (Fundam. Informaticae, 2014)

SMT Versus Genetic and OpenOpt Algorithms: Concrete Planning in the PlanICS Framework. - Artur Niewiadomski 001; Jaroslaw Skaruz; Wojciech Penczek; Maciej Szreter; Mariusz Jarocki (Fundam. Informaticae, 2014)

Preface. - Wojciech Penczek; Ludwik Czaja (Fundam. Informaticae, 2014)

Hybrid Planning by Combining SMT and Simulated Annealing. - Jaroslaw Skaruz; Artur Niewiadomski 001; Wojciech Penczek (CS&P, 2015)

Generating None-Plans in Order to Find Plans. - Michal Knapik; Artur Niewiadomski 001; Wojciech Penczek (SEFM, 2015)

Model checking temporal properties of reaction systems. - Artur Meski; Wojciech Penczek; Grzegorz Rozenberg (Inf. Sci., 2015)

Action Synthesis for Branching Time Logic: Theory and Applications. - Michal Knapik; Artur Meski; Wojciech Penczek (ACM Trans. Embed. Comput. Syst., 2015)

SMT-Based Abstract Parametric Temporal Planning. - Artur Niewiadomski 001; Wojciech Penczek (Trans. Petri Nets Other Model. Concurr., 2015)

Controlling Actions and Time in Parametric Timed Automata. - Étienne André; Michal Knapik; Wojciech Penczek; Laure Petrucci (ACSD, 2016)

Multi-Valued Verification of Strategic Ability. - Wojciech Jamroga; Beata Konikowska; Wojciech Penczek (AAMAS, 2016)

TripICS - a Web Service Composition System for Planning Trips and Travels (extended abstract). - Artur Niewiadomski 001; Wojciech Penczek (CS&P, 2016)

Towards Quantitative Verification of Reaction Systems. - Artur Meski; Maciej Koutny; Wojciech Penczek (UCNC, 2016)

Preface. - Ludwik Czaja; Wojciech Penczek; Krzysztof Stencel (Fundam. Informaticae, 2016)

Preface. - Raymond Devillers; Antti Valmari; Wojciech Penczek (Fundam. Informaticae, 2016)

Concrete Planning in PlanICS Framework by Combining SMT with GEO and Simulated Annealing. - Artur Niewiadomski 001; Jaroslaw Skaruz; Piotr Switalski; Wojciech Penczek (Fundam. Informaticae, 2016)

SMT-Based Parameter Synthesis for Parametric Timed Automata. - Michal Knapik; Wojciech Penczek (Challenging Problems and Solutions in Intelligent Systems, 2016)

Combining ontology reductions with new approaches to automated abstract planning of Planics. - Artur Niewiadomski 001; Wojciech Penczek; Jaroslaw Skaruz; Maciej Szreter; Agata Pólrola (Appl. Soft Comput., 2017)

Verification of Linear-Time Temporal Properties for Reaction Systems with Discrete Concentrations. - Artur Meski; Maciej Koutny; Wojciech Penczek (Fundam. Informaticae, 2017)

Towards Partial Order Reductions for Strategic Ability. - Wojciech Jamroga; Wojciech Penczek; Piotr Dembinski; Antoni W. Mazurkiewicz (AAMAS, 2018)

Improving Efficiency of Model Checking for Variants of Alternating-time Temporal Logic. - Wojciech Penczek (CS&P, 2018)

Reaction Mining for Reaction Systems. - Artur Meski; Maciej Koutny; Wojciech Penczek (UCNC, 2018)

SMT-Solvers in Action: Encoding and Solving Selected Problems in NP and EXPTIME. - Artur Niewiadomski 001; Piotr Switalski; Teofil Sidoruk; Wojciech Penczek (Sci. Ann. Comput. Sci., 2018)

Preface. - Wil M. P. van der Aalst; Eike Best; Wojciech Penczek (Fundam. Informaticae, 2018)

Preface. - Ludwik Czaja; Wojciech Penczek; Holger Schlingloff; Hung Son Nguyen (Fundam. Informaticae, 2018)

TripICS - a Web Service Composition System for Planning Trips and Travels. - Artur Niewiadomski 001; Piotr Switalski; Marcin Kowalczyk; Wojciech Penczek (Fundam. Informaticae, 2018)

All True Concurrency Models Start with Petri Nets: A Personal Tribute to Carl Adam Petri. - Wojciech Penczek (Carl Adam Petri: Ideas, Personality, Impact, 2019)

Squeezing State Spaces of (Attack-Defence) Trees. - Laure Petrucci; Michal Knapik; Wojciech Penczek; Teofil Sidoruk (ICECCS, 2019)

Hackers vs. Security: Attack-Defence Trees as Asynchronous Multi-Agent Systems. - Jaime Arias 001; Carlos E. Budde; Wojciech Penczek; Laure Petrucci; Mariëlle Stoelinga (CoRR, 2019)

Preface. - Victor Khomenko; Jetty Kleijn; Wojciech Penczek; Olivier H. Roux (Fundam. Informaticae, 2019)

Applying Modern SAT-solvers to Solving Hard Problems. - Artur Niewiadomski 001; Piotr Switalski; Teofil Sidoruk; Wojciech Penczek (Fundam. Informaticae, 2019)

Preface. - Wojciech Penczek; Holger Schlingloff; Piotr Wasilewski (Fundam. Informaticae, 2019)

Timed ATL: Forget Memory, Just Count. - Michal Knapik; Étienne André; Laure Petrucci; Wojciech Jamroga; Wojciech Penczek (J. Artif. Intell. Res., 2019)

Parametric Verification: An Introduction. - Étienne André; Michal Knapik; Didier Lime; Wojciech Penczek; Laure Petrucci (Trans. Petri Nets Other Model. Concurr., 2019)

MsATL: A Tool for SAT-Based ATL Satisfiability Checking. - Artur Niewiadomski 001; Magdalena Kacprzak; Damian Kurpiewski; Michal Knapik; Wojciech Penczek; Wojciech Jamroga (AAMAS, 2020)

Hackers vs. Security: Attack-Defence Trees as Asynchronous Multi-agent Systems. - Jaime Arias 001; Carlos E. Budde; Wojciech Penczek; Laure Petrucci; Teofil Sidoruk; Mariëlle Stoelinga (ICFEM, 2020)

SAT-Based ATL Satisfiability Checking. - Magdalena Kacprzak; Artur Niewiadomski 001; Wojciech Penczek (KR, 2020)

Strategic Abilities of Asynchronous Agents: Semantic Paradoxes and How to Tame Them. - Wojciech Jamroga; Wojciech Penczek; Teofil Sidoruk (CoRR, 2020)

Multi-valued Verification of Strategic Ability. - Wojciech Jamroga; Beata Konikowska; Damian Kurpiewski; Wojciech Penczek (Fundam. Informaticae, 2020)

Towards Partial Order Reductions for Strategic Ability. - Wojciech Jamroga; Wojciech Penczek; Teofil Sidoruk; Piotr Dembinski; Antoni W. Mazurkiewicz (J. Artif. Intell. Res., 2020)

ADT2AMAS: Managing Agents in Attack-Defence Scenarios. - Jaime Arias 001; Wojciech Penczek; Laure Petrucci; Teofil Sidoruk (AAMAS, 2021)

Strategic Abilities of Asynchronous Agents: Semantic Side Effects. - Wojciech Jamroga; Wojciech Penczek; Teofil Sidoruk (AAMAS, 2021)

Strategic Abilities of Asynchronous Agents: Semantic Side Effects and How to Tame Them. - Wojciech Jamroga; Wojciech Penczek; Teofil Sidoruk (KR, 2021)

Satisfiability Checking of Strategy Logic with Simple Goals. - Magdalena Kacprzak; Artur Niewiadomski 001; Wojciech Penczek (KR, 2021)

SMT-Based Unbounded Model Checking for ATL. - Michal Kanski; Artur Niewiadomski 001; Magdalena Kacprzak; Wojciech Penczek; Wojciech Nabialek (VECoS, 2021)

Minimal Schedule with Minimal Number of Agents in Attack-Defence Trees. - Jaime Arias 001; Wojciech Penczek; Laure Petrucci; Teofil Sidoruk (CoRR, 2021)

Preface. - Jörg Keller 001; Wojciech Penczek (Fundam. Informaticae, 2021)

Preface. - Holger Schlingloff; Wojciech Penczek (Fundam. Informaticae, 2021)

Verification of Multi-Agent Properties in Electronic Voting: A Case Study. - Wojtek Jamroga; Lukasz Masko; Lukasz Mikulski; Witold Pazderski; Wojciech Penczek; Teofil Sidoruk; Damian Kurpiewski (AiML, 2022)

Minimal Schedule with Minimal Number of Agents in Attack-Defence Trees. - Jaime Arias 001; Laure Petrucci; Lukasz Masko; Wojciech Penczek; Teofil Sidoruk (ICECCS, 2022)

Modular Analysis of Tree-Topology Models. - Jaime Arias 001; Michal Knapik; Wojciech Penczek; Laure Petrucci (ICFEM, 2022)

Model Checking of Strategic Timed Temporal Logics (Invited Talk). - Wojciech Penczek (PNSE@Petri Nets, 2023)

Strategic (Timed) Computation Tree Logic. - Jaime Arias 001; Wojciech Jamroga; Wojciech Penczek; Laure Petrucci; Teofil Sidoruk (AAMAS, 2023)

SMT-Based Satisfiability Checking of Strategic Metric Temporal Logic. - Magdalena Kacprzak; Artur Niewiadomski 001; Wojciech Penczek; Andrzej Zbrzezny (ECAI, 2023)

Optimal Scheduling of Agents in ADTrees: Specialised Algorithm and Declarative Models. - Jaime Arias 001; Carlos Olarte; Laure Petrucci; Lukasz Masko; Wojciech Penczek; Teofil Sidoruk (CoRR, 2023)

SMT4SMTL: A Tool for SMT-Based Satisfiability Checking of SMTL. - Artur Niewiadomski 001; Maciej Nazarczuk; Mateusz Przychodzki; Magdalena Kacprzak; Wojciech Penczek; Andrzej Zbrzezny (AAMAS, 2024)

Model Checking and Synthesis for Strategic Timed CTL using Strategies in Rewriting Logic. - Jaime Arias 001; Carlos Olarte; Wojciech Penczek; Laure Petrucci; Teofil Sidoruk (PPDP, 2024)

Asynchronous Agents with Perfect Recall: Model Reductions, Knowledge-Based Construction, and Model Checking for Coalitional Strategies. - Dilian Gurov; Filip Jamroga; Wojciech Jamroga; Mateusz Kaminski; Damian Kurpiewski; Wojciech Penczek; Teofil Sidoruk (CoRR, 2024)

Reaction mining for reaction systems. - Artur Meski; Maciej Koutny; Lukasz Mikulski; Wojciech Penczek (Nat. Comput., 2024)

Optimal Scheduling of Agents in ADTrees: Specialized Algorithm and Declarative Models. - Jaime Arias 001; Carlos Olarte; Laure Petrucci; Lukasz Masko; Wojciech Penczek; Teofil Sidoruk (IEEE Trans. Reliab., 2024)

Satisfiability Checking for (Strategic) Timed CTL Using IMITATOR. - Wojciech Penczek; Laure Petrucci; Teofil Sidoruk (ICAART (1), 2025)

Probabilistic Timed ATL. - Wojciech Jamroga; Marta Kwiatkowska; Wojciech Penczek; Laure Petrucci; Teofil Sidoruk (AAMAS, 2025)

Practical Abstractions for Model Checking Continuous-Time Multi-Agent Systems. - Yan Kim; Wojciech Jamroga; Wojciech Penczek; Laure Petrucci (AAMAS, 2025)