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 …

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 symbolic approaches to bounded model checking (BMC) for the
existential fragment of linear temporal logic extended with the epistemic component …

We develop the theoretical foundations of a predicate abstraction methodology for the
verification of multi-agent systems. We put forward a specification language based on …

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 …

In this paper we report a new SAT solver for difference logic, a propositional logic enriched
with timing constraints. The main novelty of our solver is a tighter integration of the …

Timed automata (TAs) are a common formalism for modeling timed systems. Bounded
model checking (BMC) is a verification method that searches for runs violating a property …

Bounded model checking (BMC) is an automatic verification method that is based on finitely
unfolding the system's transition relation. BMC has been successfully applied, in particular …

We present nine SAT-solvers and compare their efficiency for several decision and
combinatorial problems: three classical NP-complete problems of the graph theory, bounded …

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 …