default search action
Andrzej Zbrzezny
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c46]Artur Niewiadomski, Maciej Nazarczuk, Mateusz Przychodzki, Magdalena Kacprzak, Wojciech Penczek, Andrzej Zbrzezny:
SMT4SMTL: A Tool for SMT-Based Satisfiability Checking of SMTL. AAMAS 2024: 2815-2817 - 2023
- [c45]Magdalena Kacprzak
, Artur Niewiadomski
SMT-Based Satisfiability Checking of Strategic Metric Temporal Logic. ECAI 2023: 1180-1189 - 2022
- [j27]Agnieszka M. Zbrzezny
Bounded Model Checking for Metric Temporal Logic Properties of Timed Automata with Digital Clocks. Sensors 22(23): 9552 (2022) - [c44]Agnieszka M. Zbrzezny, Andrzej Zbrzezny
SMT-based BMC for Dense Timed Interpreted Systems and EMTLK Properties. ICAART (1) 2022: 345-352 - 2021
- [j26]Sabina Szymoniak
SAT and SMT-Based Verification of Security Protocols Including Time Aspects. Sensors 21(9): 3055 (2021) - [c43]Heiko Bühler, Andrzej Zbrzezny
Towards a Formal Verification of Seamless Cryptographic Rekeying in Real-Time Communication Systems. IDAACS 2021: 343-347 - 2020
- [c42]Agnieszka M. Zbrzezny, Andrzej Zbrzezny
VerSecTis - An Agent based Model Checker for Security Protocols. AAMAS 2020: 2123-2125
2010 – 2019
- 2019
- [j25]Anna Sawicka, Magdalena Kacprzak
Towards Encoding of the Transition Relation in Dialogue Games Model Checking. Fundam. Informaticae 165(3-4): 345-361 (2019) - [c41]Agnieszka M. Zbrzezny, Andrzej Zbrzezny:
Checking MTL Properties of Timed Automata with Dense Time using Satisfiability Modulo Theories (Extended Abstract). CS&P 2019 - [c40]Magdalena Kacprzak
SMT-Based Encoding of Argumentation Dialogue Games. ICAISC (2) 2019: 564-574 - 2018
- [c39]Agnieszka M. Zbrzezny
SAT-Based BMC Approach to Verifying Real-Time Properties of Multi-Agent Systems. AICCSA 2018: 1-8 - [c38]Magdalena Kacprzak
Modelling the Affective Power of Locutions in a Persuasive Dialogue Game. ICAISC (2) 2018: 557-569 - 2017
- [j24]Bozena Wozna-Szczesniak
SMT-based Searching for k-quasi-optimal Runs in Weighted Timed Automata. Fundam. Informaticae 152(4): 411-433 (2017) - [c37]Agnieszka M. Zbrzezny
Simple Bounded MTLK Model Checking for Timed Interpreted Systems. KES-AMSTA 2017: 88-98 - [c36]Anna Sawicka, Magdalena Kacprzak
A Novel Description Language for Two-Agent Dialogue Games. IJCRS (2) 2017: 466-486 - [c35]Agnieszka M. Zbrzezny
Simple SMT-Based Bounded Model Checking for Timed Interpreted Systems. IJCRS (2) 2017: 487-504 - 2016
- [j23]Bozena Wozna-Szczesniak
Checking EMTLK Properties of Timed Interpreted Systems Via Bounded Model Checking. Stud Logica 104(4): 641-678 (2016) - [c34]Agnieszka Zbrzezny, Andrzej Zbrzezny:
Simple Bounded MTL Model Checking for Discrete Timed Automata (extended abstract). CS&P 2016: 37-48 - [c33]Magdalena Kacprzak, Anna Sawicka, Andrzej Zbrzezny:
Towards Model Checking Argumentative Dialogues with Emotional Reasoning (extended abstract). CS&P 2016: 257-268 - [c32]Magdalena Kacprzak
Towards Verification of Dialogue Protocols: A Mathematical Model. ICAISC (2) 2016: 329-339 - [c31]Agnieszka M. Zbrzezny
Efficient Model Checking Timed and Weighted Interpreted Systems Using SMT and SAT Solvers. KES-AMSTA 2016: 45-55 - [c30]Agnieszka M. Zbrzezny
Verifying Real-Time Properties of Multi-agent Systems via SMT-Based Bounded Model Checking. PRIMA 2016: 149-167 - 2015
- [j22]Agnieszka M. Zbrzezny, Andrzej Zbrzezny
Checking RTECTL properties of STSs via SMT-based Bounded Model Checking. Int. J. Interact. Multim. Artif. Intell. 3(5): 28-35 (2015) - [c29]Magdalena Kacprzak
Dialogue Systems: Modeling and Prediction of their Dynamics. AECIA 2015: 421-431 - [c28]Agnieszka M. Zbrzezny, Bozena Wozna-Szczesniak, Andrzej Zbrzezny:
SMT-based Bounded Model Checking for Weighted Interpreted Systems and for Weighted Epistemic ECTL. AAMAS 2015: 1671-1672 - [c27]Bozena Wozna-Szczesniak, Agnieszka M. Zbrzezny, Andrzej Zbrzezny:
SMT-based Searching for k-quasi-optimal Runs in Weighted Timed Automata. CS&P 2015: 196-206 - [c26]Agnieszka M. Zbrzezny
Checking RTECTL Properties of STSs via SMT-Based Bounded Model Checking. DCAI 2015: 55-62 - [c25]Agnieszka M. Zbrzezny
Checking WECTLK Properties of Timed Real-Weighted Interpreted Systems via SMT-Based Bounded Model Checking. EPIA 2015: 638-650 - [c24]Agnieszka M. Zbrzezny
SMT-Based Bounded Model Checking for Weighted Epistemic ECTL. EPIA 2015: 651-657 - [c23]Agnieszka Zbrzezny
Checking WECTLK Properties of TRWISs via SMT-based Bounded Model Checking. ICCSW 2015: 78-86 - [c22]Agnieszka M. Zbrzezny
Checking WELTLK Properties of Weighted Interpreted Systems via SMT-Based Bounded Model Checking. PRIMA 2015: 660-669 - 2014
- [j21]Artur Meski
BDD-versus SAT-based bounded model checking for the existential fragment of linear temporal logic with knowledge: algorithms and their performance. Auton. Agents Multi Agent Syst. 28(4): 558-604 (2014) - [j20]Bozena Wozna-Szczesniak
Checking MTL Properties of Discrete Timed Automata via Bounded Model Checking. Fundam. Informaticae 135(4): 553-568 (2014) - [c21]Agnieszka Zbrzezny, Andrzej Zbrzezny:
A Comparison of SAT-Based and SMT-Based Bounded Model Checking Methods for ECTL. CS&P 2014: 293-300 - [c20]Agnieszka Zbrzezny, Andrzej Zbrzezny:
System Monitoring with Extended Message Sequence Chart (Extended Abstract). CS&P 2014: 301-307 - [c19]Bozena Wozna-Szczesniak
Bounded Model Checking for Weighted Interpreted Systems and for Flat Weighted Epistemic Computation Tree Logic. PRIMA 2014: 107-115 - 2013
- [j19]Bozena Wozna-Szczesniak
A Translation of the Existential Model Checking Problem from MITL to HLTL. Fundam. Informaticae 122(4): 401-420 (2013) - [j18]Agata Janowska, Wojciech Penczek
Using Integer Time Steps for Checking Branching Time Properties of Time Petri Nets. Trans. Petri Nets Other Model. Concurr. 8: 89-105 (2013) - [c18]Bozena Wozna-Szczesniak, Andrzej Zbrzezny:
Checking MTL Properties of Discrete Timed Automata via Bounded Model Checking. CS&P 2013: 469-477 - [c17]Andrzej Zbrzezny:
On Boolean Encodings of Transition Relation for Parallel Compositions of Transition Systems. CS&P 2013: 478-489 - [c16]Artur Meski
Two Approaches to Bounded Model Checking for a Soft Real-Time Epistemic Computation Tree Logic. DCAI 2013: 483-491 - [c15]Bozena Wozna-Szczesniak
SAT-Based Bounded Model Checking for RTECTL and Simply-Timed Systems. EPEW 2013: 337-349 - [c14]Bozena Wozna-Szczesniak
SAT-Based Bounded Model Checking for Weighted Interpreted Systems and Weighted Linear Temporal Logic. PRIMA 2013: 355-371 - 2012
- [j17]Wojciech Penczek
Towards SAT-based BMC for LTLK over Interleaved Interpreted Systems. Fundam. Informaticae 119(3-4): 373-392 (2012) - [j16]Artur Niewiadomski
Towards Automatic Composition of Web Services: SAT-Based Concretisation of Abstract Scenarios. Fundam. Informaticae 120(2): 181-203 (2012) - [j15]Andrzej Zbrzezny
A New Translation from ECTL* to SAT. Fundam. Informaticae 120(3-4): 375-395 (2012) - [c13]Artur Meski, Wojciech Penczek, Maciej Szreter, Bozena Wozna-Szczesniak, Andrzej Zbrzezny:
Bounded model checking for knowledge and linear time. AAMAS 2012: 1447-1448 - [c12]Agata Janowska, Wojciech Penczek, Agata Pólrola, Andrzej Zbrzezny:
Using Integer Time Steps for Checking Branching Time Properties of Time Petri Nets. PNSE 2012: 15-31 - [c11]Bozena Wozna-Szczesniak
SAT-Based BMC for Deontic Metric Temporal Logic and Deontic Interleaved Interpreted Systems. DALT 2012: 170-189 - [c10]Bozena Wozna-Szczesniak
SAT-Based Bounded Model Checking for Deontic Interleaved Interpreted Systems. KES-AMSTA 2012: 494-503 - [c9]Artur Meski
Two Approaches to Bounded Model Checking for Linear Time Logic with Knowledge. KES-AMSTA 2012: 514-523 - 2011
- [j14]Dariusz Doliwa, Wojciech Horzelski
PlanICS - a Web Service Composition Toolset. Fundam. Informaticae 112(1): 47-71 (2011) - [c8]Artur Meski, Agata Pólrola, Wojciech Penczek, Bozena Wozna-Szczesniak, Andrzej Zbrzezny:
Bounded Model Checking Approaches for Verification of Distributed Time Petri Nets. PNSE 2011: 72-91 - [c7]Bozena Wozna-Szczesniak
The BMC Method for the Existential Part of RTCTLK and Interleaved Interpreted Systems. EPIA 2011: 551-565 - 2010
- [j13]Wojciech Penczek
SAT-Based (Parametric) Reachability for a Class of Distributed Time Petri Nets. Trans. Petri Nets Other Model. Concurr. 4: 72-97 (2010) - [j12]Michal Knapik, Artur Niewiadomski
Parametric Model Checking with VerICS. Trans. Petri Nets Other Model. Concurr. 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
- [j11]Artur Rataj, Bozena Wozna
A Translator of Java Programs to TADDs. Fundam. Informaticae 93(1-3): 305-324 (2009) - 2008
- [j10]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. Informaticae 85(1-4): 313-328 (2008) - [j9]Andrzej Zbrzezny:
Improving the Translation from ECTL to SAT. Fundam. Informaticae 85(1-4): 513-531 (2008) - [j8]Andrzej Zbrzezny, Bozena Wozna:
Towards Verification of Java Programs in perICS. Fundam. Informaticae 85(1-4): 533-548 (2008) - 2007
- [j7]Bozena Wozna, Andrzej Zbrzezny:
Bounded Model Checking for the Existential Fragment of TCTL-G and Diagonal Timed Automata. Fundam. Informaticae 79(1-2): 229-256 (2007) - [j6]Andrzej Zbrzezny, Agata Pólrola:
SAT-Based Reachability Checking for Timed Automata with Discrete Data. Fundam. Informaticae 79(3-4): 579-593 (2007) - 2006
- [c5]Alessio Lomuscio
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
- [j5]Andrzej Zbrzezny:
SAT-based Reachability Checking for Timed Automata with Diagonal Constraints. Fundam. Informaticae 67(1-3): 303-322 (2005) - 2004
- [j4]Andrzej Zbrzezny:
Improvements in SAT-based Reachability Analysis for Timed Automata. Fundam. Informaticae 60(1-4): 417-434 (2004) - 2003
- [j3]Bozena Wozna, Andrzej Zbrzezny, Wojciech Penczek:
Checking Reachability Properties for Timed Automata via SAT. Fundam. Informaticae 55(2): 223-241 (2003) - [c3]Bozena Wozna
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
Verics: A Tool for Verifying Timed Automata and Estelle Specifications. TACAS 2003: 278-283 - 2002
- [j2]Wojciech Penczek, Bozena Wozna, Andrzej Zbrzezny:
Bounded Model Checking for the Universal Fragment of CTL. Fundam. Informaticae 51(1-2): 135-156 (2002) - [c1]Wojciech Penczek, Bozena Wozna
Towards Bounded Model Checking for the Universal Fragment of TCTL. FTRTFT 2002: 265-290
1990 – 1999
- 1990
- [j1]Andrzej Zbrzezny
The hilbert type axiomatization of some three-valued propositional logic. Math. Log. Q. 36(5): 415-421 (1990)
Coauthor Index
aka: Bozena Wozna-Szczesniak
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: