Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics. - Michal Knapik; Wojciech Penczek; Maciej Szreter; Agata Pólrola (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)

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

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

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

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

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

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

Approximating Strategic Abilities under Imperfect Information: a Naive Approach. - Wojciech Jamroga; Michal Knapik; Damian Kurpiewski (CoRR, 2015)

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

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

An Approach to Model Checking ATLir. - Wojciech Jamroga; Michal Knapik; Damian Kurpiewski (CoRR, 2016)

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

Fixpoint Approximation of Strategic Abilities under Imperfect Information. - Wojciech Jamroga; Michal Knapik; Damian Kurpiewski (AAMAS, 2017)

Model Checking the SELENE E-Voting Protocol in Multi-agent Logics. - Wojciech Jamroga; Michal Knapik; Damian Kurpiewski (E-Vote-ID, 2018)

STV: Model Checking for Strategies under Imperfect Information. - Damian Kurpiewski; Wojciech Jamroga; Michal Knapik (AAMAS, 2019)

On Domination and Control in Strategic Ability. - Damian Kurpiewski; Michal Knapik; Wojciech Jamroga (BNAIC/BENELEARN, 2019)

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

Some Things are Easier for the Dumb and the Bright Ones (Beware the Average!). - Wojciech Jamroga; Michal Knapik (IJCAI, 2019)

Approximate verification of strategic abilities under imperfect information. - Wojciech Jamroga; Michal Knapik; Damian Kurpiewski; Lukasz Mikulski (Artif. Intell., 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)

Modular Analysis of Tree-Topology Models. - Laure Petrucci; Michal Knapik (CoRR, 2020)

Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol. - Francesco Belardinelli; Rodica Condurache; Catalin Dima; Wojciech Jamroga; Michal Knapik (Inf. Comput., 2021)

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