The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Wojciech Penczek: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  58. Partial order reductions for model checking temporal epistemic logics over interleaved multi-agent systems. [Citation Graph (, )][DBLP]


  59. Runtime monitoring of contract regulated web services. [Citation Graph (, )][DBLP]


  60. Towards Checking Parametric Reachability for UML State Machines. [Citation Graph (, )][DBLP]


  61. Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic. [Citation Graph (, )][DBLP]


Search in 0.943secs, Finished in 0.945secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002