Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Andrzej Zbrzezny
2010 – today
- 2013
[j17]Bozena Wozna-Szczesniak, Andrzej Zbrzezny: A Translation of the Existential Model Checking Problem from MITL to HLTL. Fundam. Inform. 122(4): 401-420 (2013)- 2012
[j16]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)
[j15]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)
[j14]
[c10]Artur Meski, Wojciech Penczek, Maciej Szreter, Bozena Wozna-Szczesniak, Andrzej Zbrzezny: Bounded model checking for knowledge and linear time. AAMAS 2012: 1447-1448
[c9]Bozena Wozna-Szczesniak, Andrzej Zbrzezny: SAT-Based Bounded Model Checking for Deontic Interleaved Interpreted Systems. KES-AMSTA 2012: 494-503
[c8]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- 2011
[j13]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)
[c7]Bozena Wozna-Szczesniak, Agnieszka Zbrzezny, Andrzej Zbrzezny: The BMC Method for the Existential Part of RTCTLK and Interleaved Interpreted Systems. EPIA 2011: 551-565- 2010
[j12]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)
[j11]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)
[c6]Wojciech Penczek, Agata Pólrola, Andrzej Zbrzezny: Towards Automatic Composition of Web Services: A SAT-Based Phase. ACSD/Petri Nets Workshops 2010: 453-473
2000 – 2009
- 2009
[j10]Artur Rataj, Bozena Wozna, Andrzej Zbrzezny: A Translator of Java Programs to TADDs. Fundam. Inform. 93(1-3): 305-324 (2009)- 2008
[j9]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)
[j8]Andrzej Zbrzezny: Improving the Translation from ECTL to SAT. Fundam. Inform. 85(1-4): 513-531 (2008)
[j7]Andrzej Zbrzezny, Bozena Wozna: Towards Verification of Java Programs in perICS. Fundam. Inform. 85(1-4): 533-548 (2008)- 2007
[j6]Bozena Wozna, Andrzej Zbrzezny: Bounded Model Checking for the Existential Fragment of TCTL-G and Diagonal Timed Automata. Fundam. Inform. 79(1-2): 229-256 (2007)
[j5]Andrzej Zbrzezny, Agata Pólrola: SAT-Based Reachability Checking for Timed Automata with Discrete Data. Fundam. Inform. 79(3-4): 579-593 (2007)- 2006
[c5]Alessio Lomuscio, Bozena Wozna, Andrzej Zbrzezny: Bounded Model Checking Real-Time Multi-agent Systems with Clock Differences: Theory and Implementation. MoChArt 2006: 95-112
[c4]Miroslaw Kurkowski, Wojciech Penczek, Andrzej Zbrzezny: SAT-Based Verification of Security Protocols Via Translation to Networks of Automata. MoChArt 2006: 146-165- 2005
[j4]Andrzej Zbrzezny: SAT-based Reachability Checking for Timed Automata with Diagonal Constraints. Fundam. Inform. 67(1-3): 303-322 (2005)- 2004
[j3]Andrzej Zbrzezny: Improvements in SAT-based Reachability Analysis for Timed Automata. Fundam. Inform. 60(1-4): 417-434 (2004)- 2003
[j2]Bozena Wozna, Andrzej Zbrzezny, Wojciech Penczek: Checking Reachability Properties for Timed Automata via SAT. Fundam. Inform. 55(2): 223-241 (2003)
[c3]Bozena Wozna, Andrzej Zbrzezny: Checking ACTL* Properties of Discrete Timed Automata via Bounded Model Checking. FORMATS 2003: 18-33
[c2]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- 2002
[j1]Wojciech Penczek, Bozena Wozna, Andrzej Zbrzezny: Bounded Model Checking for the Universal Fragment of CTL. Fundam. Inform. 51(1-2): 135-156 (2002)
[c1]Wojciech Penczek, Bozena Wozna, Andrzej Zbrzezny: Towards Bounded Model Checking for the Universal Fragment of TCTL. FTRTFT 2002: 265-290
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-09 22:03 CEST by the dblp team



