The Symbolic Analysis Laboratory (SAL) is a set of tools for the specification, exploration, and verification of state-transition systems. SAL includes symbolic model-checking tools based on solvers and decision procedures for linear arithmetic, uninterpreted functions, and propositional logic, among others. This enables the analysis of a variety of infinite-state systems. In particular, SAL can be used to model and verify timed systems, which combine real-valued and discrete state variables. This document reports on several examples and experiments in modeling and verification of timed system in SAL. Different specification approaches are presented and compared, from a direct encoding of traditional timed automata to a novel modeling metho...
Probabilistic timed automata are timed automata extended with discrete probabil-ity distributions, a...
Abstract. This chapter is to provide a tutorial and pointers to results and related work on timed au...
AbstractWe describe a novel methodology for analyzing timed systems symbolically. Given a formula re...
Abstract—Safety instrumented systems (SIS) monitor indus-trial processes and automatically react on ...
Various methodologies to model and analyze timed and hybrid systems using SAL are reported. We assum...
The Symbolic Analysis Laboratory (SAL) is a suite of tools for analysis of state transition systems....
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally ...
Timed systems have become ubiquitous in the past few years. Some of them (e.g., automated plane and ...
Abstract. Modeling time related aspects is important in many applications of verification methods. F...
The design of correct computer systems is extremely difficult. However, it is also a very important ...
Julkaistu vain painettuna, saatavuus katso Bibid. Published only in printed form, availability see B...
Symbolic model checking is a powerful technique for checking temporal logic properties over finite o...
We describe finite-state programs over real-numbered time in a guarded-command language with real-v...
AbstractThe design of correct computer systems is extremely difficult. However, it is also a very im...
AbstractWe describe finite-state programs over real-numbered time in a guarded-command language with...
Probabilistic timed automata are timed automata extended with discrete probabil-ity distributions, a...
Abstract. This chapter is to provide a tutorial and pointers to results and related work on timed au...
AbstractWe describe a novel methodology for analyzing timed systems symbolically. Given a formula re...
Abstract—Safety instrumented systems (SIS) monitor indus-trial processes and automatically react on ...
Various methodologies to model and analyze timed and hybrid systems using SAL are reported. We assum...
The Symbolic Analysis Laboratory (SAL) is a suite of tools for analysis of state transition systems....
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally ...
Timed systems have become ubiquitous in the past few years. Some of them (e.g., automated plane and ...
Abstract. Modeling time related aspects is important in many applications of verification methods. F...
The design of correct computer systems is extremely difficult. However, it is also a very important ...
Julkaistu vain painettuna, saatavuus katso Bibid. Published only in printed form, availability see B...
Symbolic model checking is a powerful technique for checking temporal logic properties over finite o...
We describe finite-state programs over real-numbered time in a guarded-command language with real-v...
AbstractThe design of correct computer systems is extremely difficult. However, it is also a very im...
AbstractWe describe finite-state programs over real-numbered time in a guarded-command language with...
Probabilistic timed automata are timed automata extended with discrete probabil-ity distributions, a...
Abstract. This chapter is to provide a tutorial and pointers to results and related work on timed au...
AbstractWe describe a novel methodology for analyzing timed systems symbolically. Given a formula re...