2009 | ||
---|---|---|
67 | 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) | |
66 | Miroslaw Kurkowski, Wojciech Penczek: Timed Automata Based Model Checking of Timed Security Protocols. Fundam. Inform. 93(1-3): 245-259 (2009) | |
65 | Artur Niewiadomski, Wojciech Penczek, Maciej Szreter: A New Approach to Model Checking of UML State Machines. Fundam. Inform. 93(1-3): 289-303 (2009) | |
2008 | ||
64 | Alessio Lomuscio, Wojciech Penczek, Hongyang Qu: Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic. MoChArt 2008: 106-121 | |
63 | 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) | |
62 | Alessio Lomuscio, Wojciech Penczek: LDYIS: a Framework for Model Checking Security Protocols. Fundam. Inform. 85(1-4): 359-375 (2008) | |
61 | Wojciech Penczek, Maciej Szreter: SAT-based Unbounded Model Checking of Timed Automata. Fundam. Inform. 85(1-4): 425-440 (2008) | |
2007 | ||
60 | Wojciech Penczek, Maciej Szreter: SAT-based Unbounded Model Checking of Timed Automata. ACSD 2007: 236-237 | |
59 | Gizela Jakubowska, Wojciech Penczek: Is Your Security Protocol on Time ? FSEN 2007: 65-80 | |
58 | Alessio Lomuscio, Wojciech Penczek, Bozena Wozna: Bounded model checking for knowledge and real time. Artif. Intell. 171(16-17): 1011-1038 (2007) | |
57 | Alessio Lomuscio, Wojciech Penczek: Logic Column 19: Symbolic Model Checking for Temporal-Epistemic Logics CoRR abs/0709.0446: (2007) | |
56 | Gizela Jakubowska, Wojciech Penczek: Modelling and Checking Timed Authentication of Security Protocols. Fundam. Inform. 79(3-4): 363-378 (2007) | |
55 | Agata Janowska, Wojciech Penczek: Path Compression in Timed Automata. Fundam. Inform. 79(3-4): 379-399 (2007) | |
54 | Miroslaw Kurkowski, Wojciech Penczek: Verifying Security Protocols Modelled by Networks of Automata. Fundam. Inform. 79(3-4): 453-471 (2007) | |
53 | Alessio Lomuscio, Wojciech Penczek: Symbolic model checking for temporal-epistemic logics. SIGACT News 38(3): 77-99 (2007) | |
2006 | ||
52 | Wojciech Penczek, Agata Pólrola: Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach. Springer 2006 | |
51 | Beata Konikowska, Wojciech Penczek: Model checking for multivalued logic of knowledge and time. AAMAS 2006: 169-176 | |
50 | Miroslaw Kurkowski, Wojciech Penczek, Andrzej Zbrzezny: SAT-Based Verification of Security Protocols Via Translation to Networks of Automata. MoChArt 2006: 146-165 | |
49 | 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) | |
2005 | ||
48 | Bozena Wozna, Alessio Lomuscio, Wojciech Penczek: Bounded model checking for knowledge and real time. AAMAS 2005: 165-172 | |
47 | Magdalena Kacprzak, Wojciech Penczek: Fully Symbolic Unbounded Model Checking for Alternating-time Temporal Logic1. Autonomous Agents and Multi-Agent Systems 11(1): 69-89 (2005) | |
46 | Bozena Wozna, Alessio Lomuscio, Wojciech Penczek: Bounded Model Checking for Deontic Interpreted Systems. Electr. Notes Theor. Comput. Sci. 126: 93-114 (2005) | |
2004 | ||
45 | Magdalena Kacprzak, Alessio Lomuscio, Wojciech Penczek: Verification of Multiagent Systems via Unbounded Model Checking. AAMAS 2004: 638-645 | |
44 | Magdalena Kacprzak, Wojciech Penczek: Unbounded Model Checking for Alternating-Time Temporal Logic. AAMAS 2004: 646-653 | |
43 | Magdalena Kacprzak, Alessio Lomuscio, T. Lasica, Wojciech Penczek, Maciej Szreter: Verifying Multi-agent Systems via Unbounded Model Checking. FAABS 2004: 189-212 | |
42 | Wojciech Penczek, Agata Pólrola: Specification and Model Checking of Temporal Properties in Time Petri Nets and Timed Automata. ICATPN 2004: 37-76 | |
41 | Beata Konikowska, Wojciech Penczek: On Designated Values in Multi-valued CTL* Model Checking. Fundam. Inform. 60(1-4): 211-224 (2004) | |
40 | Agata Pólrola, Wojciech Penczek: Minimization Algorithms for Time Petri Nets. Fundam. Inform. 60(1-4): 307-331 (2004) | |
39 | Magdalena Kacprzak, Alessio Lomuscio, Wojciech Penczek: From Bounded to Unbounded Model Checking for Temporal Epistemic Logic. Fundam. Inform. 63(2-3): 221-240 (2004) | |
2003 | ||
38 | Wojciech Penczek, Alessio Lomuscio: Verifying epistemic properties of multi-agent systems via bounded model checking. AAMAS 2003: 209-216 | |
37 | Agata Pólrola, Wojciech Penczek, Maciej Szreter: Towards Efficient Partition Refinement for Checking Reachability in Timed Automata. FORMATS 2003: 2-17 | |
36 | 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 | |
35 | Wojciech Penczek, Alessio Lomuscio: Verifying Epistemic Properties of Multi-agent Systems via Bounded Model Checking. Fundam. Inform. 55(2): 167-185 (2003) | |
34 | Agata Pólrola, Wojciech Penczek, Maciej Szreter: Reachability Analysis for Timed Automata Using Partitioning Algorithms. Fundam. Inform. 55(2): 203-221 (2003) | |
33 | Bozena Wozna, Andrzej Zbrzezny, Wojciech Penczek: Checking Reachability Properties for Timed Automata via SAT. Fundam. Inform. 55(2): 223-241 (2003) | |
2002 | ||
32 | Beata Konikowska, Wojciech Penczek: Reducing Model Checking from Multi-valued {\rm CTL}^{\ast} to {\rm CTL}^{\ast}. CONCUR 2002: 226-239 | |
31 | Alessio Lomuscio, T. Lasica, Wojciech Penczek: Bounded Model Checking for Interpreted Systems: Preliminary Experimental Results. FAABS 2002: 115-125 | |
30 | Wojciech Penczek, Bozena Wozna, Andrzej Zbrzezny: Towards Bounded Model Checking for the Universal Fragment of TCTL. FTRTFT 2002: 265-290 | |
29 | Henri Hansen, Wojciech Penczek, Antti Valmari: Stuttering-Insensitive Automata for On-the-fly Detection of Livelock Properties. Electr. Notes Theor. Comput. Sci. 66(2): (2002) | |
28 | Wojciech Penczek, Bozena Wozna, Andrzej Zbrzezny: Bounded Model Checking for the Universal Fragment of CTL. Fundam. Inform. 51(1-2): 135-156 (2002) | |
27 | Piotr Dembinski, Wojciech Penczek, Agata Pólrola: Verification of Timed Automata Based on Similarity. Fundam. Inform. 51(1-2): 59-89 (2002) | |
2001 | ||
26 | Wojciech Penczek: Efficient Model Checking of Causal-Knowledge Protocols. CEEMAS 2001: 242-252 | |
25 | Wojciech Penczek, Agata Pólrola: Abstractions and Partial Order Reductions for Checking Branching Properties of Time Petri Nets. ICATPN 2001: 323-342 | |
24 | Piotr Dembinski, Wojciech Penczek, Agata Pólrola: Automated Verification of Infinite State Concurrent Systems. PPAM 2001: 247-255 | |
2000 | ||
23 | Stanislaw Ambroszkiewicz, Wojciech Penczek, Tomasz Nowak: Towards Formal Specification and Verification in Cyberspace. FAABS 2000: 16-32 | |
22 | Stanislaw Ambroszkiewicz, Krzysztof Cetnarowicz, Jaroslaw Kozlak, Tomasz Nowak, Wojciech Penczek: Modeling Agent Organizations. Intelligent Information Systems 2000: 135-144 | |
21 | 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) | |
20 | Wojciech Penczek: Temporal Approach to Causal Knowledge. Logic Journal of the IGPL 8(1): (2000) | |
1999 | ||
19 | Stanislaw Ambroszkiewicz, Wojciech Penczek: Local Interactions, Explicit Communication and Causal Knowledge in Games and Multi-Agent Systems. CEEMAS 1999 | |
18 | Wojciech Penczek, Stanislaw Ambroszkiewicz: Model checking of causal knowledge formulas. Electr. Notes Theor. Comput. Sci. 28: (1999) | |
17 | 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) | |
1998 | ||
16 | Stanislaw Ambroszkiewicz, Olaf Matyja, Wojciech Penczek: Team Formation by Self-Interested Mobile Agents. DAI 1998: 1-15 | |
1997 | ||
15 | Wojciech Penczek: Model-Checking for a Subclass of Event Structures. TACAS 1997: 145-164 | |
1996 | ||
14 | Wojciech Penczek, Andrzej Szalas: Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings Springer 1996 | |
13 | Wojciech Penczek: Axiomatizations of Temporal Logics on Trace Systems. Fundam. Inform. 25(2): 183-200 (1996) | |
1995 | ||
12 | Rob Gerth, Ruurd Kuiper, Doron Peled, Wojciech Penczek: A Partial Order Approach to Branching Time Logic Model Checking. ISTCS 1995: 130-139 | |
11 | Rajeev Alur, Doron Peled, Wojciech Penczek: Model-Checking of Causality Properties LICS 1995: 90-100 | |
10 | Doron Peled, Wojciech Penczek: Using asynchronous Büchi automata for efficient automatic verification of concurrent systems. PSTV 1995: 315-330 | |
1994 | ||
9 | Marta Z. Kwiatkowska, Doron Peled, Wojciech Penczek: A Hierarchy of Partial Order Temporal Properties. ICTL 1994: 398-414 | |
1993 | ||
8 | Wojciech Penczek: Axiomatizations of Temporal Logics on Trace Systems. STACS 1993: 452-462 | |
7 | Wojciech Penczek: Temporal Logics for Trace Systems: On Automated Verification. Int. J. Found. Comput. Sci. 4(1): 31-67 (1993) | |
1992 | ||
6 | Ursula Goltz, Ruurd Kuiper, Wojciech Penczek: Propositional Temporal Logics and Equivalences. CONCUR 1992: 222-236 | |
5 | Wojciech Penczek: On Undecidability of Propositional Temporal Logics on Trace Systems. Inf. Process. Lett. 43(3): 147-153 (1992) | |
1990 | ||
4 | Edward Ochmanski, Wojciech Penczek: Inevitability in diamond processes. ITA 24: 37-46 (1990) | |
1989 | ||
3 | Wojciech Penczek: A Concurrent Branching Time Temporal Logic. CSL 1989: 337-354 | |
2 | Wojciech Penczek: A Temporal Logic for the Local Specification of Concurrent Systems. IFIP Congress 1989: 857-862 | |
1 | Antoni W. Mazurkiewicz, Edward Ochmanski, Wojciech Penczek: Concurrent Systems and Inevitability. Theor. Comput. Sci. 64(3): 281-304 (1989) |