The evaluation of successor or predecessor state spaces through time progress is a central component in the model-checking algorithm of dense-time automata. The definition of the t...
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
We study a binary-cell-states eight-cell neighborhood two-dimensional cellular automaton model of a quasi-chemical system with a substrate and a reagent. Reactions are represented...
We present the development of T-UPPAAL — a new tool for online black-box testing of real-time embedded systems from non-deterministic timed automata specifications. It is based ...
Kim Guldstrand Larsen, Marius Mikucionis, Brian Ni...
In multi-valued model checking, a temporal logic formula is interpreted relative to a structure not as a truth value but as a lattice element. In this paper we present new algorith...