Wojciech Penczek

Lars Michael Kristensen, Wojciech Penczek, Laure Petrucci: Preface. Fundam. Inform. 122(1-2) (2013)

Wojciech Penczek, Bozena Wozna-Szczesniak, Andrzej Zbrzezny: Towards SAT-based BMC for LTLK over Interleaved Interpreted Systems. Fundam. Inform. 119(3-4): 373-392 (2012)

Artur Niewiadomski, Wojciech Penczek, Agata Pólrola, Maciej Szreter, Andrzej Zbrzezny: Towards Automatic Composition of Web Services: SAT-Based Concretisation of Abstract Scenarios. Fundam. Inform. 120(2): 181-203 (2012)

Wojciech Penczek: Preface. Fundam. Inform. 120(3-4) (2012)

Michal Knapik, Wojciech Penczek: Bounded Model Checking for Parametric Timed Automata. T. Petri Nets and Other Models of Concurrency 5: 141-159 (2012)

Andrew V. Jones, Michal Knapik, Wojciech Penczek, Alessio Lomuscio: Group synthesis for parametric temporal-epistemic logic. AAMAS 2012: 1107-1114

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

Alessio Lomuscio, Wojciech Penczek: Symbolic Model Checking for Temporal-Epistemic Logic. Logic Programs, Norms and Action 2012: 172-195

Artur Meski, Wojciech Penczek, Maciej Szreter: Bounded Model Checking for Linear Time Temporal-Epistemic Logic. ICCSW 2012: 88-94

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

Dariusz Doliwa, Wojciech Horzelski, Mariusz Jarocki, Artur Niewiadomski, Wojciech Penczek, Agata Pólrola, Jaroslaw Skaruz: HarmonICS - a Tool for Composing Medical Services. ZEUS 2012: 25-33

Artur Meski, Wojciech Penczek, Agata Pólrola: BDD-based Bounded Model Checking for Temporal Properties of 1-Safe Petri Nets. Fundam. Inform. 109(3): 305-321 (2011)

Alessio Lomuscio, Wojciech Penczek, Monika Solanki, Maciej Szreter: Runtime Monitoring of Contract Regulated Web Services. Fundam. Inform. 111(3): 339-355 (2011)

Dariusz Doliwa, Wojciech Horzelski, Mariusz Jarocki, Artur Niewiadomski, Wojciech Penczek, Agata Pólrola, Maciej Szreter, Andrzej Zbrzezny: PlanICS - a Web Service Composition Toolset. Fundam. Inform. 112(1): 47-71 (2011)

Wojciech Penczek: Preface. Fundam. Inform. 112(1) (2011)

Johan Lilius, Wojciech Penczek: Preface. Fundam. Inform. 113(3-4) (2011)

Wojciech Jamroga, Wojciech Penczek: Specification and Verification of Multi-Agent Systems. ESSLLI 2011: 210-263

Michal Knapik, Wojciech Penczek, Maciej Szreter, Agata Pólrola: Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics. Fundam. Inform. 101(1-2): 9-27 (2010)

Alessio Lomuscio, Wojciech Penczek, Hongyang Qu: Partial Order Reductions for Model Checking Temporal-epistemic Logics over Interleaved Multi-agent Systems. Fundam. Inform. 101(1-2): 71-90 (2010)

Wojciech Penczek: Preface. Fundam. Inform. 102(1) (2010)

Giuliana Franceschinis, Wojciech Penczek, Karsten Wolf: Preface. Fundam. Inform. 105(3) (2010)

Michal Knapik, Maciej Szreter, Wojciech Penczek: Bounded Parametric Model Checking for Elementary Net Systems. T. Petri Nets and Other Models of Concurrency 4: 42-71 (2010)

Wojciech Penczek, Agata Pólrola, Andrzej Zbrzezny: SAT-Based (Parametric) Reachability for a Class of Distributed Time Petri Nets. T. Petri Nets and Other Models of Concurrency 4: 72-97 (2010)

Michal Knapik, Artur Niewiadomski, Wojciech Penczek, Agata Pólrola, Maciej Szreter, Andrzej Zbrzezny: Parametric Model Checking with VerICS. T. Petri Nets and Other Models of Concurrency 4: 98-120 (2010)

Michal Knapik, Wojciech Penczek: Bounded Model Checking for Parametric Timed Automata. ACSD/Petri Nets Workshops 2010: 419-435

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

Alessio Lomuscio, Wojciech Penczek, Hongyang Qu: Partial order reductions for model checking temporal epistemic logics over interleaved multi-agent systems. AAMAS 2010: 659-666

Alessio Lomuscio, Monika Solanki, Wojciech Penczek, Maciej Szreter: Runtime monitoring of contract regulated web services. AAMAS 2010: 1449-1450

Johan Lilius, Wojciech Penczek (Eds.): Applications and Theory of Petri Nets, 31st International Conference, PETRI NETS 2010, Braga, Portugal, June 21-25, 2010. Proceedings. Lecture Notes in Computer Science 6128, Springer 2010, isbn 978-3-642-13674-0

Gizela Jakubowska, Piotr Dembinski, Wojciech Penczek, Maciej Szreter: Simulation of Security Protocols based on Scenarios of Attacks. Fundam. Inform. 93(1-3): 185-203 (2009)

Miroslaw Kurkowski, Wojciech Penczek: Timed Automata Based Model Checking of Timed Security Protocols. Fundam. Inform. 93(1-3): 245-259 (2009)

Artur Niewiadomski, Wojciech Penczek, Maciej Szreter: A New Approach to Model Checking of UML State Machines. Fundam. Inform. 93(1-3): 289-303 (2009)

Artur Niewiadomski, Wojciech Penczek, Maciej Szreter: Towards Checking Parametric Reachability for UML State Machines. Ershov Memorial Conference 2009: 319-330

Magdalena Kacprzak, Wojciech Nabialek, Artur Niewiadomski, Wojciech Penczek, Agata Pólrola, Maciej Szreter, Bozena Wozna, Andrzej Zbrzezny: VerICS 2007 - a Model Checker for Knowledge and Real-Time. Fundam. Inform. 85(1-4): 313-328 (2008)

Alessio Lomuscio, Wojciech Penczek: LDYIS: a Framework for Model Checking Security Protocols. Fundam. Inform. 85(1-4): 359-375 (2008)

Wojciech Penczek, Maciej Szreter: SAT-based Unbounded Model Checking of Timed Automata. Fundam. Inform. 85(1-4): 425-440 (2008)

Alessio Lomuscio, Wojciech Penczek, Hongyang Qu: Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic. MoChArt 2008: 106-121

Alessio Lomuscio, Wojciech Penczek, Bozena Wozna: Bounded model checking for knowledge and real time. Artif. Intell. 171(16-17): 1011-1038 (2007)

Gizela Jakubowska, Wojciech Penczek: Modelling and Checking Timed Authentication of Security Protocols. Fundam. Inform. 79(3-4): 363-378 (2007)

Agata Janowska, Wojciech Penczek: Path Compression in Timed Automata. Fundam. Inform. 79(3-4): 379-399 (2007)

Miroslaw Kurkowski, Wojciech Penczek: Verifying Security Protocols Modelled by Networks of Automata. Fundam. Inform. 79(3-4): 453-471 (2007)

Alessio Lomuscio, Wojciech Penczek: Symbolic model checking for temporal-epistemic logics. SIGACT News 38(3): 77-99 (2007)

Wojciech Penczek, Maciej Szreter: SAT-based Unbounded Model Checking of Timed Automata. ACSD 2007: 236-237

Gizela Jakubowska, Wojciech Penczek: Is Your Security Protocol on Time ? FSEN 2007: 65-80

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

Wojciech Penczek, Agata Pólrola: Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach. Studies in Computational Intelligence 20, Springer 2006, isbn 978-3-540-32869-8

Magdalena Kacprzak, Alessio Lomuscio, Artur Niewiadomski, Wojciech Penczek, Franco Raimondi, Maciej Szreter: Comparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol. Fundam. Inform. 72(1-3): 215-234 (2006)

Beata Konikowska, Wojciech Penczek: Model checking for multivalued logic of knowledge and time. AAMAS 2006: 169-176

Miroslaw Kurkowski, Wojciech Penczek, Andrzej Zbrzezny: SAT-Based Verification of Security Protocols Via Translation to Networks of Automata. MoChArt 2006: 146-165

Magdalena Kacprzak, Wojciech Penczek: Fully Symbolic Unbounded Model Checking for Alternating-time Temporal Logic¹. Autonomous Agents and Multi-Agent Systems 11(1): 69-89 (2005)

Bozena Wozna, Alessio Lomuscio, Wojciech Penczek: Bounded Model Checking for Deontic Interpreted Systems. Electr. Notes Theor. Comput. Sci. 126: 93-114 (2005)

Bozena Wozna, Alessio Lomuscio, Wojciech Penczek: Bounded model checking for knowledge and real time. AAMAS 2005: 165-172

Beata Konikowska, Wojciech Penczek: On Designated Values in Multi-valued CTL^* Model Checking. Fundam. Inform. 60(1-4): 211-224 (2004)

Agata Pólrola, Wojciech Penczek: Minimization Algorithms for Time Petri Nets. Fundam. Inform. 60(1-4): 307-331 (2004)

Magdalena Kacprzak, Alessio Lomuscio, Wojciech Penczek: From Bounded to Unbounded Model Checking for Temporal Epistemic Logic. Fundam. Inform. 63(2-3): 221-240 (2004)

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

Magdalena Kacprzak, Alessio Lomuscio, Wojciech Penczek: Verification of Multiagent Systems via Unbounded Model Checking. AAMAS 2004: 638-645

Magdalena Kacprzak, Wojciech Penczek: Unbounded Model Checking for Alternating-Time Temporal Logic. AAMAS 2004: 646-653

Magdalena Kacprzak, Alessio Lomuscio, T. Lasica, Wojciech Penczek, Maciej Szreter: Verifying Multi-agent Systems via Unbounded Model Checking. FAABS 2004: 189-212

Wojciech Penczek, Alessio Lomuscio: Verifying Epistemic Properties of Multi-agent Systems via Bounded Model Checking. Fundam. Inform. 55(2): 167-185 (2003)

Agata Pólrola, Wojciech Penczek, Maciej Szreter: Reachability Analysis for Timed Automata Using Partitioning Algorithms. Fundam. Inform. 55(2): 203-221 (2003)

Bozena Wozna, Andrzej Zbrzezny, Wojciech Penczek: Checking Reachability Properties for Timed Automata via SAT. Fundam. Inform. 55(2): 223-241 (2003)

Wojciech Penczek, Alessio Lomuscio: Verifying epistemic properties of multi-agent systems via bounded model checking. AAMAS 2003: 209-216

Agata Pólrola, Wojciech Penczek, Maciej Szreter: Towards Efficient Partition Refinement for Checking Reachability in Timed Automata. FORMATS 2003: 2-17

Piotr Dembinski, Agata Janowska, Pawel Janowski, Wojciech Penczek, Agata Pólrola, Maciej Szreter, Bozena Wozna, Andrzej Zbrzezny: Verics: A Tool for Verifying Timed Automata and Estelle Specifications. TACAS 2003: 278-283

Henri Hansen, Wojciech Penczek, Antti Valmari: Stuttering-Insensitive Automata for On-the-fly Detection of Livelock Properties. Electr. Notes Theor. Comput. Sci. 66(2): 178-193 (2002)

Piotr Dembinski, Wojciech Penczek, Agata Pólrola: Verification of Timed Automata Based on Similarity. Fundam. Inform. 51(1-2): 59-89 (2002)

Wojciech Penczek, Bozena Wozna, Andrzej Zbrzezny: Bounded Model Checking for the Universal Fragment of CTL. Fundam. Inform. 51(1-2): 135-156 (2002)

Beata Konikowska, Wojciech Penczek: Reducing Model Checking from Multi-valued {\rm CTL}^{\ast} to {\rm CTL}^{\ast}. CONCUR 2002: 226-239

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

Wojciech Penczek, Bozena Wozna, Andrzej Zbrzezny: Towards Bounded Model Checking for the Universal Fragment of TCTL. FTRTFT 2002: 265-290

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

Wojciech Penczek: Efficient Model Checking of Causal-Knowledge Protocols. CEEMAS 2001: 242-252

Piotr Dembinski, Wojciech Penczek, Agata Pólrola: Automated Verification of Infinite State Concurrent Systems. PPAM 2001: 247-255

Wojciech Penczek, Maciej Szreter, Rob Gerth, Ruurd Kuiper: Improving Partial Order Reductions for Universal Branching Time Properties. Fundam. Inform. 43(1-4): 245-267 (2000)

Wojciech Penczek: Temporal Approach to Causal Knowledge. Logic Journal of the IGPL 8(1): 87-99 (2000)

Stanislaw Ambroszkiewicz, Wojciech Penczek, Tomasz Nowak: Towards Formal Specification and Verification in Cyberspace. FAABS 2000: 16-32

Stanislaw Ambroszkiewicz, Krzysztof Cetnarowicz, Jaroslaw Kozlak, Tomasz Nowak, Wojciech Penczek: Modeling Agent Organizations. Intelligent Information Systems 2000: 135-144

Wojciech Penczek, Stanislaw Ambroszkiewicz: Model checking of causal knowledge formulas. Electr. Notes Theor. Comput. Sci. 28: 40-58 (1999)

Rob Gerth, Ruurd Kuiper, Doron Peled, Wojciech Penczek: A Partial Order Approach to Branching Time Logic Model Checking. Inf. Comput. 150(2): 132-152 (1999)

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

Stanislaw Ambroszkiewicz, Olaf Matyja, Wojciech Penczek: Team Formation by Self-Interested Mobile Agents. DAI 1998: 1-15

Wojciech Penczek: Model-Checking for a Subclass of Event Structures. TACAS 1997: 145-164

Wojciech Penczek: Axiomatizations of Temporal Logics on Trace Systems. Fundam. Inform. 25(2): 183-200 (1996)

Wojciech Penczek, Andrzej Szalas (Eds.): Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings. Lecture Notes in Computer Science 1113, Springer 1996, isbn 3-540-61550-4

Rob Gerth, Ruurd Kuiper, Doron Peled, Wojciech Penczek: A Partial Order Approach to Branching Time Logic Model Checking. ISTCS 1995: 130-139

Rajeev Alur, Doron Peled, Wojciech Penczek: Model-Checking of Causality Properties. LICS 1995: 90-100

Doron Peled, Wojciech Penczek: Using asynchronous Büchi automata for efficient automatic verification of concurrent systems. PSTV 1995: 315-330

Marta Z. Kwiatkowska, Doron Peled, Wojciech Penczek: A Hierarchy of Partial Order Temporal Properties. ICTL 1994: 398-414

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

Wojciech Penczek: Axiomatizations of Temporal Logics on Trace Systems. STACS 1993: 452-462

Wojciech Penczek: On Undecidability of Propositional Temporal Logics on Trace Systems. Inf. Process. Lett. 43(3): 147-153 (1992)

Ursula Goltz, Ruurd Kuiper, Wojciech Penczek: Propositional Temporal Logics and Equivalences. CONCUR 1992: 222-236

Edward Ochmanski, Wojciech Penczek: Inevitability in diamond processes. ITA 24: 37-46 (1990)

Antoni W. Mazurkiewicz, Edward Ochmanski, Wojciech Penczek: Concurrent Systems and Inevitability. Theor. Comput. Sci. 64(3): 281-304 (1989)

Wojciech Penczek: A Concurrent Branching Time Temporal Logic. CSL 1989: 337-354

Wojciech Penczek: A Temporal Logic for the Local Specification of Concurrent Systems. IFIP Congress 1989: 857-862