Enormous progress has been achieved in the last decade in the verification of timed
systems, making it possible to analyze significant real-world protocols. An open challenge is …

Verification of real-time systems is an important subject of research. This is highly motivated
by an increasing demand to verify safety critical systems, ie, time-dependent distributed …

Given a timed automaton M, a linear temporal logic formula φ, and a bound k, bounded
model checking for timed automata determines if there is a falsifying path of length k to the …

The paper presents a new tool for automated verification of Timed Automata as well as
protocols written in the specification language Estelle. The current version offers an …

The paper deals with the problem of checking reachability for timed automata. The main
idea consists in combining the well-know forward reachability algorithm and the Bounded …

The paper surveys some of the most recent approaches to verification of properties,
expressible in some timed and untimed temporal logics (LTL, CTL, TCTL), for real-time …

We present TECTLK, a logic to specify knowledge and real time in multi-agent systems. We
show that the TECTLK model checking problem is decidable, and we present an algorithm …

The objective of this paper is to offer an improvement to the translation from ECTL to SAT
introduced in [14] and show that the improvement proposed substantially increases the …

The main contribution of the paper consists in showing that the bounded model checking
(BMC) method is feasible for ACTLS*(the universal fragment of CTLS*) which subsumes …

Reachability analysis for timed automata using SAT-based methods was considered in
many papers, occurring to be a very efficient model checking technique. In this paper we …