Abstract. When designing an open system, there might be no implementation available for certain components at verification time. For such systems, verification has to be based on a...
The tcc model is a formalism for reactive concurrent constraint programming. We present a model of temporal concurrent constraint programming which adds to tcc the capability of mo...
Mogens Nielsen, Catuscia Palamidessi, Frank D. Val...
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
In modern thermonuclear fusion devices it is possible to distinguish distinct types of plasma confinement regimes which have different performance in terms of confinement time. Dis...
Guido Vagliasindi, Paolo Arena, Luigi Fortuna, And...
We propose a framework for the formal speci cation and veri cation of timed and hybrid systems. For timed systems we propose a speci cation language that refers to time only throug...