default search action
Michal Knapik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i6]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) - 2022
- [c18]Jaime Arias
, Michal Knapik
Modular Analysis of Tree-Topology Models. ICFEM 2022: 36-53 - [i5]Francesco Belardinelli, Rodica Condurache, Catalin Dima, Wojciech Jamroga, Michal Knapik:
Bisimulations for Verifying Strategic Abilities with an Application to the ThreeBallot Voting Protocol. CoRR abs/2203.13692 (2022) - 2021
- [j10]Francesco Belardinelli
Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol. Inf. Comput. 276: 104552 (2021) - 2020
- [c17]Artur Niewiadomski
MsATL: A Tool for SAT-Based ATL Satisfiability Checking. AAMAS 2020: 2111-2113 - [i4]Laure Petrucci, Michal Knapik:
Modular Analysis of Tree-Topology Models. CoRR abs/2012.04739 (2020)
2010 – 2019
- 2019
- [j9]Wojciech Jamroga
Approximate verification of strategic abilities under imperfect information. Artif. Intell. 277 (2019) - [j8]Michal Knapik
Timed ATL: Forget Memory, Just Count. J. Artif. Intell. Res. 66: 197-223 (2019) - [j7]Étienne André
Parametric Verification: An Introduction. Trans. Petri Nets Other Model. Concurr. 14: 64-100 (2019) - [c16]Damian Kurpiewski
On Domination and Control in Strategic Ability. AAMAS 2019: 197-205 - [c15]Damian Kurpiewski
STV: Model Checking for Strategies under Imperfect Information. AAMAS 2019: 2372-2374 - [c14]Damian Kurpiewski
On Domination and Control in Strategic Ability. BNAIC/BENELEARN 2019 - [c13]Laure Petrucci
Squeezing State Spaces of (Attack-Defence) Trees. ICECCS 2019: 71-80 - [c12]Wojciech Jamroga
Some Things are Easier for the Dumb and the Bright Ones (Beware the Average!). IJCAI 2019: 1734-1740 - [i3]Étienne André, Michal Knapik, Didier Lime, Wojciech Penczek, Laure Petrucci
Parametric Verification: An Introduction. CoRR abs/1907.00555 (2019) - 2018
- [c11]Wojciech Jamroga
Model Checking the SELENE E-Voting Protocol in Multi-agent Logics. E-Vote-ID 2018: 100-116 - 2017
- [c10]Wojciech Jamroga, Michal Knapik
Fixpoint Approximation of Strategic Abilities under Imperfect Information. AAMAS 2017: 1241-1249 - [c9]Étienne André, Laure Petrucci, Wojciech Jamroga, Michal Knapik
Timed ATL: Forget Memory, Just Count. AAMAS 2017: 1460-1462 - 2016
- [c8]Étienne André
Controlling Actions and Time in Parametric Timed Automata. ACSD 2016: 45-54 - [p1]Michal Knapik, Wojciech Penczek
SMT-Based Parameter Synthesis for Parametric Timed Automata. Challenging Problems and Solutions in Intelligent Systems 2016: 3-21 - [i2]Wojciech Jamroga, Michal Knapik, Damian Kurpiewski:
An Approach to Model Checking ATLir. CoRR abs/1612.02684 (2016) - 2015
- [j6]Michal Knapik
Action Synthesis for Branching Time Logic: Theory and Applications. ACM Trans. Embed. Comput. Syst. 14(4): 64:1-64:23 (2015) - [c7]Michal Knapik, Artur Niewiadomski
Generating None-Plans in Order to Find Plans. SEFM 2015: 310-324 - [i1]Wojciech Jamroga, Michal Knapik, Damian Kurpiewski:
Approximating Strategic Abilities under Imperfect Information: a Naive Approach. CoRR abs/1510.06587 (2015) - 2014
- [j5]Michal Knapik
Parameter Synthesis for Timed Kripke Structures. Fundam. Informaticae 133(2-3): 211-226 (2014) - [c6]Michal Knapik
Action Synthesis for Branching Time Logic: Theory and Applications. ACSD 2014: 1-10 - [c5]Michal Knapik, Wojciech Penczek
Fixed-Point Methods in Parametric Model Checking. IEEE Conf. on Intelligent Systems (1) 2014: 231-242 - 2013
- [c4]Michal Knapik
Parameter Synthesis for Timed Kripke Structures. CS&P 2013: 259-270 - 2012
- [j4]Michal Knapik, Wojciech Penczek
Bounded Model Checking for Parametric Timed Automata. Trans. Petri Nets Other Model. Concurr. 5: 141-159 (2012) - [c3]Andrew V. Jones, Michal Knapik
Group synthesis for parametric temporal-epistemic logic. AAMAS 2012: 1107-1114 - [c2]Michal Knapik
SMT-based parameter synthesis for L/U automata. PNSE 2012: 77-92 - 2010
- [j3]Michal Knapik
Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics. Fundam. Informaticae 101(1-2): 9-27 (2010) - [j2]Michal Knapik, Maciej Szreter, Wojciech Penczek
Bounded Parametric Model Checking for Elementary Net Systems. Trans. Petri Nets Other Model. Concurr. 4: 42-71 (2010) - [j1]Michal Knapik, Artur Niewiadomski
Parametric Model Checking with VerICS. Trans. Petri Nets Other Model. Concurr. 4: 98-120 (2010) - [c1]Michal Knapik, Wojciech Penczek:
Bounded Model Checking for Parametric Timed Automata. ACSD/Petri Nets Workshops 2010: 419-435
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-25 05:58 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: