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...
This paper presents a model checking-based approach to data flow testing. We characterize data flow oriented coverage criteria in temporal logic such that the problem of test ge...
Under certain constraints the test case generation problem can be represented as a model checking problem, thus enabling the use of powerful model checking tools to perform the te...
Abstract. In this paper we present an action/state-based logical framework for the analysis and verification of complex systems, which relies on the definition of doubly labelled...
Maurice H. ter Beek, Alessandro Fantechi, Stefania...
In this paper, we present weighted/priced timed automata, an extension of timed automaton with costs, and solve several interesting problems on that model. Key words: Weighted/pri...