Andrzej Zbrzezny
Andrzej Zbrzezny
Institute of Mathematics and Computer Science, Jan Długosz University in Częstochowa
ajd.czest.pl의 이메일 확인됨 - 홈페이지
제목
인용
인용
연도
Bounded Model Checking for the Universal Fragment of CTL
W Penczek, B Wozna, A Zbrzezny
Fundamenta Informaticae 51 (1-2), 135-156, 2002
1362002
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
1142008
VerICS: a tool for verifying timed automata and estelle specifications
P Dembiński, A Janowska, P Janowski, W Penczek, A Półrola, M Szreter, ...
Tools and Algorithms for the Construction and Analysis of Systems, 278-283, 2003
862003
Checking reachability properties for Timed Automata via SAT
B Wozna, W Penczek, A Zbrzezny
Fundamenta Informaticae 55 (2), 223-241, 2002
662002
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
592002
Planics-a web service composition toolset
D Doliwa, W Horzelski, M Jarocki, A Niewiadomski, W Penczek, A Półrola, ...
Fundamenta Informaticae 112 (1), 47-71, 2011
402011
BDD-versus SAT-based bounded model checking for the existential fragment of linear temporal logic with knowledge: algorithms and their performance
A Mȩski, W Penczek, M Szreter, B Woźna-Szcześniak, A Zbrzezny
Autonomous Agents and Multi-Agent Systems 28 (4), 558-604, 2014
392014
Improving the translation from ECTL to SAT
A Zbrzezny
Fundamenta Informaticae 85 (1-4), 513-531, 2008
322008
SAT-based reachability checking for timed automata with diagonal constraints
A Zbrzezny
Fundamenta Informaticae 67 (1-3), 303-322, 2005
312005
A New Translation from ECTL* to SAT
A Zbrzezny
Fundamenta Informaticae 120 (3-4), 377-395, 2012
282012
A new translation from ECTL* to SAT
A Zbrzezny
CS&P 2011, 589-600, 2011
282011
Sat-based reachability checking for timed automata with discrete data
A Zbrzezny, A Półrola
Fundamenta Informaticae 79 (3-4), 579-593, 2007
262007
Improvements in SAT-based reachability analysis for timed automata
A Zbrzezny
Fundamenta Informaticae 60 (1-4), 417-434, 2004
262004
The BMC method for the existential part of RTCTLK and interleaved interpreted systems
B Woźna-Szcześniak, A Zbrzezny, A Zbrzezny
Portuguese Conference on Artificial Intelligence, 551-565, 2011
162011
Towards SAT-based BMC for LTLK over interleaved interpreted systems
W Penczek, B Woźna-Szcześniak, A Zbrzezny
Fundamenta Informaticae 119 (3-4), 373-392, 2012
142012
Reachability for timed systems based on SAT-solvers
B Wozna, W Penczek, A Zbrzezny
Proc. of the Int. Workshop on Concurrency, Specification and Programming (CS …, 0
14
SAT-based bounded model checking for weighted interpreted systems and weighted linear temporal logic
B Woźna-Szcześniak, AM Zbrzezny, A Zbrzezny
International Conference on Principles and Practice of Multi-Agent Systems …, 2013
132013
Parametric Model Checking with VerICS
M Knapik, A Niewiadomski, W Penczek, A Półrola, M Szreter, A Zbrzezny
Transactions on Petri nets and other models of concurrency IV, 98-120, 2010
112010
A translator of Java programs to TADDs
A Rataj, B Woźna, A Zbrzezny
Fundamenta Informaticae 93 (1-3), 305-324, 2009
112009
SAT-based (parametric) reachability for a class of distributed time Petri nets
W Penczek, A Półrola, A Zbrzezny
Transactions on Petri Nets and Other Models of Concurrency IV, 72-97, 2010
102010
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20