Andrzej Zbrzezny

Orcid: 0000-0003-2771-9683

According to our database1, Andrzej Zbrzezny authored at least 69 papers between 1990 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
SMT4SMTL: A Tool for SMT-Based Satisfiability Checking of SMTL.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023
SMT-Based Satisfiability Checking of Strategic Metric Temporal Logic.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

2022
Bounded Model Checking for Metric Temporal Logic Properties of Timed Automata with Digital Clocks.
Sensors, 2022

SMT-based BMC for Dense Timed Interpreted Systems and EMTLK Properties.
Proceedings of the 14th International Conference on Agents and Artificial Intelligence, 2022

2021
SAT and SMT-Based Verification of Security Protocols Including Time Aspects.
Sensors, 2021

Towards a Formal Verification of Seamless Cryptographic Rekeying in Real-Time Communication Systems.
Proceedings of the 2021 11th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS), 2021

2020
VerSecTis - An Agent based Model Checker for Security Protocols.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019
Towards Encoding of the Transition Relation in Dialogue Games Model Checking.
Fundam. Informaticae, 2019

SMT-Based Encoding of Argumentation Dialogue Games.
Proceedings of the Artificial Intelligence and Soft Computing, 2019

Checking MTL Properties of Timed Automata with Dense Time using Satisfiability Modulo Theories (Extended Abstract).
Proceedings of the 28th International Workshop on Concurrency, 2019

2018
Modelling the Affective Power of Locutions in a Persuasive Dialogue Game.
Proceedings of the Artificial Intelligence and Soft Computing, 2018

SAT-Based BMC Approach to Verifying Real-Time Properties of Multi-Agent Systems.
Proceedings of the 15th IEEE/ACS International Conference on Computer Systems and Applications, 2018

2017
SMT-based Searching for k-quasi-optimal Runs in Weighted Timed Automata.
Fundam. Informaticae, 2017

Simple SMT-Based Bounded Model Checking for Timed Interpreted Systems.
Proceedings of the Rough Sets - International Joint Conference, 2017

A Novel Description Language for Two-Agent Dialogue Games.
Proceedings of the Rough Sets - International Joint Conference, 2017

Simple Bounded MTLK Model Checking for Timed Interpreted Systems.
Proceedings of the Agent and Multi-Agent Systems: Technology and Applications, 2017

2016
Checking EMTLK Properties of Timed Interpreted Systems Via Bounded Model Checking.
Stud Logica, 2016

Verifying Real-Time Properties of Multi-agent Systems via SMT-Based Bounded Model Checking.
Proceedings of the PRIMA 2016: Princiles and Practice of Multi-Agent Systems, 2016

Efficient Model Checking Timed and Weighted Interpreted Systems Using SMT and SAT Solvers.
Proceedings of the Agent and Multi-Agent Systems: Technology and Applications, 2016

Towards Verification of Dialogue Protocols: A Mathematical Model.
Proceedings of the Artificial Intelligence and Soft Computing, 2016

Simple Bounded MTL Model Checking for Discrete Timed Automata (extended abstract).
Proceedings of the 25th International Workshop on Concurrency, 2016

Towards Model Checking Argumentative Dialogues with Emotional Reasoning (extended abstract).
Proceedings of the 25th International Workshop on Concurrency, 2016

2015
Checking RTECTL properties of STSs via SMT-based Bounded Model Checking.
Int. J. Interact. Multim. Artif. Intell., 2015

Checking WELTLK Properties of Weighted Interpreted Systems via SMT-Based Bounded Model Checking.
Proceedings of the PRIMA 2015: Principles and Practice of Multi-Agent Systems, 2015

Checking WECTLK Properties of TRWISs via SMT-based Bounded Model Checking.
Proceedings of the 2015 Imperial College Computing Student Workshop, 2015

Checking WECTLK Properties of Timed Real-Weighted Interpreted Systems via SMT-Based Bounded Model Checking.
Proceedings of the Progress in Artificial Intelligence, 2015

SMT-Based Bounded Model Checking for Weighted Epistemic ECTL.
Proceedings of the Progress in Artificial Intelligence, 2015

SMT-based Bounded Model Checking for Weighted Interpreted Systems and for Weighted Epistemic ECTL.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Dialogue Systems: Modeling and Prediction of their Dynamics.
Proceedings of the Second International Afro-European Conference for Industrial Advancement, 2015

2014
Checking MTL Properties of Discrete Timed Automata via Bounded Model Checking.
Fundam. Informaticae, 2014

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., 2014

Bounded Model Checking for Weighted Interpreted Systems and for Flat Weighted Epistemic Computation Tree Logic.
Proceedings of the PRIMA 2014: Principles and Practice of Multi-Agent Systems, 2014

System Monitoring with Extended Message Sequence Chart (Extended Abstract).
Proceedings of the 23th International Workshop on Concurrency, Specification and Programming, Chemnitz, Germany, September 29, 2014

A Comparison of SAT-Based and SMT-Based Bounded Model Checking Methods for ECTL.
Proceedings of the 23th International Workshop on Concurrency, Specification and Programming, Chemnitz, Germany, September 29, 2014

2013
Using Integer Time Steps for Checking Branching Time Properties of Time Petri Nets.
Trans. Petri Nets Other Model. Concurr., 2013

A Translation of the Existential Model Checking Problem from MITL to HLTL.
Fundam. Informaticae, 2013

SAT-Based Bounded Model Checking for Weighted Interpreted Systems and Weighted Linear Temporal Logic.
Proceedings of the PRIMA 2013: Principles and Practice of Multi-Agent Systems, 2013

SAT-Based Bounded Model Checking for RTECTL and Simply-Timed Systems.
Proceedings of the Computer Performance Engineering - 10th European Workshop, 2013

Two Approaches to Bounded Model Checking for a Soft Real-Time Epistemic Computation Tree Logic.
Proceedings of the Distributed Computing and Artificial Intelligence, 2013

On Boolean Encodings of Transition Relation for Parallel Compositions of Transition Systems.
Proceedings of the 22nd International Workshop on Concurrency, 2013

2012
A New Translation from ECTL* to SAT.
Fundam. Informaticae, 2012

Towards SAT-based BMC for LTLK over Interleaved Interpreted Systems.
Fundam. Informaticae, 2012

Towards Automatic Composition of Web Services: SAT-Based Concretisation of Abstract Scenarios.
Fundam. Informaticae, 2012

SAT-Based Bounded Model Checking for Deontic Interleaved Interpreted Systems.
Proceedings of the Agent and Multi-Agent Systems. Technologies and Applications, 2012

Two Approaches to Bounded Model Checking for Linear Time Logic with Knowledge.
Proceedings of the Agent and Multi-Agent Systems. Technologies and Applications, 2012

SAT-Based BMC for Deontic Metric Temporal Logic and Deontic Interleaved Interpreted Systems.
Proceedings of the Declarative Agent Languages and Technologies X, 2012

Bounded model checking for knowledge and linear time.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

2011
PlanICS - a Web Service Composition Toolset.
Fundam. Informaticae, 2011

The BMC Method for the Existential Part of RTCTLK and Interleaved Interpreted Systems.
Proceedings of the Progress in Artificial Intelligence, 2011

Bounded Model Checking Approaches for Verification of Distributed Time Petri Nets.
Proceedings of the International Workshop on Petri Nets and Software Engineering, 2011

2010
SAT-Based (Parametric) Reachability for a Class of Distributed Time Petri Nets.
Trans. Petri Nets Other Model. Concurr., 2010

Parametric Model Checking with VerICS.
Trans. Petri Nets Other Model. Concurr., 2010

Towards Automatic Composition of Web Services: A SAT-Based Phase.
Proceedings of the Workshops of the 31st International Conference on Application and Theory of Petri Nets and Other Models of Concurrency (PETRI NETS 2010) and of the 10th International Conference on Application of Concurrency to System Design (ACSD 2010), 2010

2009
A Translator of Java Programs to TADDs.
Fundam. Informaticae, 2009

2008
Towards Verification of Java Programs in perICS.
Fundam. Informaticae, 2008

Improving the Translation from ECTL to SAT.
Fundam. Informaticae, 2008

VerICS 2007 - a Model Checker for Knowledge and Real-Time.
Fundam. Informaticae, 2008

2007
SAT-Based Reachability Checking for Timed Automata with Discrete Data.
Fundam. Informaticae, 2007

Bounded Model Checking for the Existential Fragment of TCTL<sub>-G</sub> and Diagonal Timed Automata.
Fundam. Informaticae, 2007

2006
Bounded Model Checking Real-Time Multi-agent Systems with Clock Differences: Theory and Implementation.
Proceedings of the Model Checking and Artificial Intelligence, 4th Workshop, 2006

SAT-Based Verification of Security Protocols Via Translation to Networks of Automata.
Proceedings of the Model Checking and Artificial Intelligence, 4th Workshop, 2006

2005
SAT-based Reachability Checking for Timed Automata with Diagonal Constraints.
Fundam. Informaticae, 2005

2004
Improvements in SAT-based Reachability Analysis for Timed Automata.
Fundam. Informaticae, 2004

2003
Checking Reachability Properties for Timed Automata via SAT.
Fundam. Informaticae, 2003

Verics: A Tool for Verifying Timed Automata and Estelle Specifications.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2003

Checking ACTL<sup>*</sup> Properties of Discrete Timed Automata via Bounded Model Checking.
Proceedings of the Formal Modeling and Analysis of Timed Systems: First International Workshop, 2003

2002
Bounded Model Checking for the Universal Fragment of CTL.
Fundam. Informaticae, 2002

Towards Bounded Model Checking for the Universal Fragment of TCTL.
Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 2002

1990
The hilbert type axiomatization of some three-valued propositional logic.
Math. Log. Q., 1990


  Loading...