Obserwuj
Michał Knapik
Michał Knapik
Institute of Computer Science of the Polish Academy of Sciences
Zweryfikowany adres z ipipan.waw.pl - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Bounded model checking for parametric timed automata
M Knapik, W Penczek
Transactions on Petri Nets and Other Models of Concurrency V, 141-159, 2012
432012
Approximate verification of strategic abilities under imperfect information
W Jamroga, M Knapik, D Kurpiewski, Ł Mikulski
Artificial Intelligence 277, 103172, 2019
302019
Model checking the SELENE e-voting protocol in multi-agent logics
W Jamroga, M Knapik, D Kurpiewski
International Joint Conference on Electronic Voting, 100-116, 2018
292018
STV: Model checking for strategies under imperfect information
D Kurpiewski, W Jamroga, ML Knapik
Proceedings of the 18th International Conference on Autonomous Agents and …, 2019
252019
Fixpoint approximation of strategic abilities under imperfect information
W Jamroga, M Knapik, D Kurpiewski
arXiv preprint arXiv:1612.02684, 2016
242016
Parametric Model Checking with VerICS
M Knapik, A Niewiadomski, W Penczek, A Półrola, M Szreter, A Zbrzezny
Transactions on Petri nets and other models of concurrency IV, 98-120, 2010
132010
Bounded parametric verification for distributed time Petri nets with discrete-time semantics
M Knapik, W Penczek, M Szreter
Fundamenta Informaticae 101 (1-2), 9-27, 2010
122010
On domination and control in strategic ability
D Kurpiewski, ML Knapik, W Jamroga
Proceedings of the 18th International Conference on Autonomous Agents and …, 2019
112019
Timed ATL: forget memory, just count
MJ Knapik, É André, L Petrucci, W Jamroga, W Penczek
Journal of Artificial Intelligence Research 66, 197-223, 2019
102019
Squeezing state spaces of (attack-defence) trees
L Petrucci, M Knapik, W Penczek, T Sidoruk
2019 24th International Conference on Engineering of Complex Computer …, 2019
92019
Timed ATL: Forget Memory, Just Count.
É André, L Petrucci, W Jamroga, M Knapik, W Penczek
Journal of Artificial Intelligence Research 66, 2019
92019
Bounded parametric model checking for elementary net systems
M Knapik, M Szreter, W Penczek
Transactions on Petri Nets and Other Models of Concurrency IV, 42-71, 2010
92010
MsATL: A tool for SAT-based ATL satisfiability checking
A Niewiadomski, M Kacprzak, D Kurpiewski, M Knapik, W Penczek, ...
Proceedings of 19th International Conference on Autonomous Agents and …, 2020
82020
Action synthesis for branching time logic: Theory and applications
M Knapik, A Męski, W Penczek
ACM Transactions on Embedded Computing Systems (TECS) 14 (4), 1-23, 2015
82015
Group synthesis for parametric temporal-epistemic logic.
AV Jones, M Knapik, W Penczek, A Lomuscio
AAMAS, 1107-1114, 2012
82012
Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol
F Belardinelli, R Condurache, C Dima, W Jamroga, M Knapik
Information and Computation 276, 104552, 2021
72021
Parametric verification: an introduction
É André, M Knapik, D Lime, W Penczek, L Petrucci
Transactions on Petri Nets and Other Models of Concurrency XIV, 64-100, 2019
72019
Controlling actions and time in parametric timed automata
É André, M Knapik, W Penczek, L Petrucci
2016 16th International Conference on Application of Concurrency to System …, 2016
42016
Parameter synthesis for timed Kripke structures
M Knapik, W Penczek
Fundamenta Informaticae 133 (2-3), 211-226, 2014
42014
SMT-based parameter synthesis for L/U automata.
M Knapik, W Penczek
PNSE 851, 77-92, 2012
42012
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20