Suivre
Wojciech Penczek
Wojciech Penczek
Professor of Computer Science, ICS PAS (Warsaw)
Adresse e-mail validée de ipipan.waw.pl
Titre
Citée par
Citée par
Année
A partial order approach to branching time logic model checking
R Gerth, R Kuiper, D Peled, W Penczek
Information and Computation 150 (2), 132-152, 1999
2411999
Verifying epistemic properties of multi-agent systems via bounded model checking
W Penczek, A Lomuscio
Proceedings of the second international joint conference on Autonomous …, 2003
2402003
Bounded model checking for the universal fragment of CTL
W Penczek, B Woźna, A Zbrzezny
Fundamenta Informaticae 51 (1-2), 135-156, 2002
1432002
Verics 2007-a model checker for knowledge and real-time
M Kacprzak, W Nabiałek, A Niewiadomski, W Penczek, A Półrola, ...
Fundamenta Informaticae 85 (1-4), 313-328, 2008
1262008
Model-checking of causality properties
R Alur, D Peled, W Penczek
Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science, 90-100, 1995
1241995
Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach
W Penczek, A Półrola
Studies in Computational Intelligence 20, Springer 2006, 2006
116*2006
Verification of multiagent systems via unbounded model checking
M Kacprzak, A Lomuscio, W Penczek
Proceedings of the Third International Joint Conference on Autonomous Agents …, 2004
982004
√ erics: a tool for verifying timed automata and estelle specifications
P Dembiński, A Janowska, P Janowski, W Penczek, A Półrola, M Szreter, ...
International Conference on Tools and Algorithms for the Construction and …, 2003
912003
Partial order reductions for model checking temporal-epistemic logics over interleaved multi-agent systems
A Lomuscio, W Penczek, H Qu
Fundamenta Informaticae 101 (1-2), 71-90, 2010
842010
A temporal logic for event structures
W Penczek
Fundamenta Informaticae 11 (3), 297-326, 1988
711988
Checking reachability properties for timed automata via SAT
B Woźna, A Zbrzezny, W Penczek
Fundamenta Informaticae 55 (2), 223-241, 2003
682003
Specification and model checking of temporal properties in time Petri nets and timed automata
W Penczek, A Półrola
International Conference on Application and Theory of Petri Nets, 37-76, 2004
652004
Propositional temporal logics and equivalences
U Goltz, R Kuiper, W Penczek
International Conference on Concurrency Theory, 222-236, 1992
651992
Towards bounded model checking for the universal fragment of TCTL
W Penczek, B Woźna, A Zbrzezny
International Symposium on Formal Techniques in Real-Time and Fault-Tolerant …, 2002
612002
Branching time and partial order in temporal logics
W Penczek
Time & Logic, 179-228, 2019
562019
Comparing BDD and SAT based techniques for model checking Chaum's dining cryptographers protocol
M Kacprzak, A Lomuscio, A Niewiadomski, W Penczek, F Raimondi, ...
Fundamenta Informaticae 72 (1-3), 215-234, 2006
552006
Bounded model checking for knowledge and real time
A Lomuscio, W Penczek, B Woźna
Artificial Intelligence 171 (16-17), 1011-1038, 2007
532007
Bounded model checking for parametric timed automata
M Knapik, W Penczek
Transactions on Petri Nets and Other Models of Concurrency V, 141-159, 2012
502012
Unbounded model checking for alternating-time temporal logic
M Kacprzak, W Penczek
Proceedings of the Third International Joint Conference on Autonomous Agents …, 2004
502004
Concurrent systems and inevitability
A Mazurkiewicz, E Ochmański, W Penczek
Theoretical Computer Science 64 (3), 281-304, 1989
491989
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20