In this paper, we suggest interval diagram techniques for formal verification of real-time systems modeled by means of timed automata. Interval diagram techniques are based on interval decision diagrams (IDDs)---representing sets of system configurations of, e.g., timed automata---and interval mapping diagrams (IMDs)--- modeling their transition behavior. IDDs are canonical representations of Boolean functions and allow for their efficient manipulation. Our approach is used for performing both timed reachability analysis and real-time symbolic model checking. We present the methods necessary for our approach and compare its results to another, similar verification technique---achieving a speedup of 7 and more. 1 Introduction Especially for...
In this work we propose a verification methodology consisting of selective quantitative analysis and...
Computers are frequently used in critical applications where predictable response times are essentia...
Timed Automata (TA) is de facto a standard modelling formalism to represent systems when the interes...
In this report, we suggest interval diagram techniques for formal verification of timed automata. In...
In this report, we suggest interval diagram techniques for formal verification of timed automata. I...
Interval diagram techniques have been applied successfully to symbolic formal verification of proces...
In this report, a representation of multi-valued functions called interval decision diagrams (IDDs) ...
Symbolic model checking tries to reduce the state explosion problem by implicit construction of the ...
Abstract The task of checking if a computer system satisfies its timing specifications is extremelyi...
In this paper, an approach to symbolic model checking of process networks is introduced. It is based...
Abstract. Based on the equivalence relation for location based reach-ability between continuous and ...
AbstractWe propose a format of predicate diagrams for the verification of real-time systems. We cons...
In this paper we analyze the efficiency of binary decision diagrams (BDDs) and clock difference diag...
The design of correct computer systems is extremely difficult. However, it is also a very important ...
AbstractThe design of correct computer systems is extremely difficult. However, it is also a very im...
In this work we propose a verification methodology consisting of selective quantitative analysis and...
Computers are frequently used in critical applications where predictable response times are essentia...
Timed Automata (TA) is de facto a standard modelling formalism to represent systems when the interes...
In this report, we suggest interval diagram techniques for formal verification of timed automata. In...
In this report, we suggest interval diagram techniques for formal verification of timed automata. I...
Interval diagram techniques have been applied successfully to symbolic formal verification of proces...
In this report, a representation of multi-valued functions called interval decision diagrams (IDDs) ...
Symbolic model checking tries to reduce the state explosion problem by implicit construction of the ...
Abstract The task of checking if a computer system satisfies its timing specifications is extremelyi...
In this paper, an approach to symbolic model checking of process networks is introduced. It is based...
Abstract. Based on the equivalence relation for location based reach-ability between continuous and ...
AbstractWe propose a format of predicate diagrams for the verification of real-time systems. We cons...
In this paper we analyze the efficiency of binary decision diagrams (BDDs) and clock difference diag...
The design of correct computer systems is extremely difficult. However, it is also a very important ...
AbstractThe design of correct computer systems is extremely difficult. However, it is also a very im...
In this work we propose a verification methodology consisting of selective quantitative analysis and...
Computers are frequently used in critical applications where predictable response times are essentia...
Timed Automata (TA) is de facto a standard modelling formalism to represent systems when the interes...