Abstract — We consider temporal logic verification of (pos-sibly nonlinear) dynamical systems evolving over continuous state spaces. Our approach combines automata-based verifica-tion and the use of so-called barrier certificates. Automata-based verification allows the decomposition the verification task into a finite collection of simpler constraints over the continuous state space. The satisfaction of these constraints in turn can be (potentially conservatively) proved by appropriately constructed barrier certificates. As a result, our approach, together with optimization-based search for barrier certificates, allows computational verification of dynamical systems against temporal logic properties while avoiding explicit abstractions of t...
We consider an extension of linear-time temporal logic (LTL) with constraints interpreted over a con...
We investigate the verification problem of two classes of infinite state systems w.r.t. nonregular p...
We present a tableau-based construction for obtaining an automaton from a temporal logic formula in ...
This paper presents a method for abstracting continuous dynamical systems by timed automata. The abs...
Formulae of linear temporal logic (LTL) can be used to specify (wanted or unwanted) properties of a ...
Abstract—We present two algorithms for bounded model checking of Regular Linear Temporal Logic (RLTL...
To enable formal verification of a dynamical system, given by a set of differential equations, it is...
AbstractWe introduce a general definition for a family of branching-time logics that extend CTL* by ...
Abstract. The automata-theoretic approach to linear temporal logic uses the theory of automata as a ...
International audienceThis chapter illustrates two aspects of automata theory related to linear-time...
ABSTRACT: Automata theory provides powerful tools for designing and implementing decision procedures...
A model has variability bounded by v/k when the state changes at most v times over any linear interv...
. The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying...
Abstract—A model has variability bounded by v/k when the state changes at most v times over any line...
Formal methods for specifying, analyzing, and manipulating the behavior of concurrent systems become...
We consider an extension of linear-time temporal logic (LTL) with constraints interpreted over a con...
We investigate the verification problem of two classes of infinite state systems w.r.t. nonregular p...
We present a tableau-based construction for obtaining an automaton from a temporal logic formula in ...
This paper presents a method for abstracting continuous dynamical systems by timed automata. The abs...
Formulae of linear temporal logic (LTL) can be used to specify (wanted or unwanted) properties of a ...
Abstract—We present two algorithms for bounded model checking of Regular Linear Temporal Logic (RLTL...
To enable formal verification of a dynamical system, given by a set of differential equations, it is...
AbstractWe introduce a general definition for a family of branching-time logics that extend CTL* by ...
Abstract. The automata-theoretic approach to linear temporal logic uses the theory of automata as a ...
International audienceThis chapter illustrates two aspects of automata theory related to linear-time...
ABSTRACT: Automata theory provides powerful tools for designing and implementing decision procedures...
A model has variability bounded by v/k when the state changes at most v times over any linear interv...
. The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying...
Abstract—A model has variability bounded by v/k when the state changes at most v times over any line...
Formal methods for specifying, analyzing, and manipulating the behavior of concurrent systems become...
We consider an extension of linear-time temporal logic (LTL) with constraints interpreted over a con...
We investigate the verification problem of two classes of infinite state systems w.r.t. nonregular p...
We present a tableau-based construction for obtaining an automaton from a temporal logic formula in ...