The paper deals with symbolic approaches to bounded model checking (BMC) for the
existential fragment of linear temporal logic extended with the epistemic component …

We present WECTL* KD, a weighted branching time temporal logic to specify knowledge,
and correct functioning behaviour in multi-agent systems (MAS). We interpret the formulae of …

Although there have been many works on bounded semantics, a characterization of a good
definition for a bounded semantics has not been given, and this has led to definitions of …

One of the main concerns of automated verification and error detection of software designs
is the efficiency. Although bounded model checking (BMC) has been proven to be effective …

We present a SAT-based bounded model checking (BMC) method for the weighted
interpreted systems (ie interpreted systems augmented to include a weight function, one per …

This work is on methodologies for checking multi-agent systems against temporal-epistemic
specifications. Since behaviors that comply with temporal-epistemic specifications in general …

Every day we use protocols unconsciously during the conversations and the ability to abide
by them is an important part of our communication skills (eg questioning the question is …

We present a novel approach to verification of multi-agent systems by bounded model
checking for Linear Time Temporal Logic extended with the epistemic component (LTLK) …

We present a novel approach to verification of multi-agent systems by bounded model
checking for LTLK, ie, Linear Time Temporal Logic extended with the epistemic component …

We investigate symbolic approaches to Bounded Model Checking (BMC) for the Linear
Temporal Logic extended with epistemic components (LTLK), interpreted over Interleaved …