We show that the problem of model checking multi-dimensional modal logics can be reduced to the problem of model checking ARCTL, an extension of the temporal logic CTL with action labels and operators to reason about actions. In particular, we introduce a methodology for model checking a temporal-epistemic logic by building upon an extension of the model checker NuSMV that enables the verification of ARCTL. We briefly present the implementation and report experimental results for the verification of a typical security protocol involving temporal-epistemic properties: the protocol of the dining cryptographers
Model-checking is a successful technique for automatically verifying concurrent finite-state systems...
We define a new temporal logic called CTL[k-QDDC]. It extends CTL with the ability to specify branch...
Temporal logics are a well investigated formalism for the specification and verification of reactive...
Abstract. Model checking as an approach to the automatic verification of finite state systems has fo...
Model checking is a promising approach to automatic verification, which has concentrated on specific...
In the literature, two powerful temporal logic formalisms have been proposed for expressing informat...
Reasoning about agents and modalities such as knowledge and belief leads to models where different r...
doi:10.4156/jcit.vol5. issue10.19 This paper investigates model-checking Needham-Schroeder Public-Ke...
Model checking has been traditionally concerned on verifying a (critical) system against its specifi...
Model checking verifies that a model of a system satisfies a given property, and otherwise produces ...
Alternating-time Temporal Logic (ATL) is a logic developed by Alur, Henzinger, and Kupferman for rea...
Alternating-time Temporal Logic (ATL) is a logic developed by Alur, Henzinger, and Kupferman for rea...
We investigate an extension of CTL (Computation Tree Logic) by past modalities, called CTLP, interpr...
AbstractWe consider automatic verification of finite state concurrent programs. The global state gra...
The specification formalism employed in model checking is usually some flavour of temporal or proces...
Model-checking is a successful technique for automatically verifying concurrent finite-state systems...
We define a new temporal logic called CTL[k-QDDC]. It extends CTL with the ability to specify branch...
Temporal logics are a well investigated formalism for the specification and verification of reactive...
Abstract. Model checking as an approach to the automatic verification of finite state systems has fo...
Model checking is a promising approach to automatic verification, which has concentrated on specific...
In the literature, two powerful temporal logic formalisms have been proposed for expressing informat...
Reasoning about agents and modalities such as knowledge and belief leads to models where different r...
doi:10.4156/jcit.vol5. issue10.19 This paper investigates model-checking Needham-Schroeder Public-Ke...
Model checking has been traditionally concerned on verifying a (critical) system against its specifi...
Model checking verifies that a model of a system satisfies a given property, and otherwise produces ...
Alternating-time Temporal Logic (ATL) is a logic developed by Alur, Henzinger, and Kupferman for rea...
Alternating-time Temporal Logic (ATL) is a logic developed by Alur, Henzinger, and Kupferman for rea...
We investigate an extension of CTL (Computation Tree Logic) by past modalities, called CTLP, interpr...
AbstractWe consider automatic verification of finite state concurrent programs. The global state gra...
The specification formalism employed in model checking is usually some flavour of temporal or proces...
Model-checking is a successful technique for automatically verifying concurrent finite-state systems...
We define a new temporal logic called CTL[k-QDDC]. It extends CTL with the ability to specify branch...
Temporal logics are a well investigated formalism for the specification and verification of reactive...