ATVA
2006
Springer
13 years 8 months ago
2006
Springer
Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here...
ATVA
2006
Springer
13 years 8 months ago
2006
Springer
Testing is one of the fundamental techniques for verifying if a computing system conforms to its specification. We take a fresh look at the theory of testing for message-passing sy...
ATVA
2006
Springer
13 years 8 months ago
2006
Springer
We present the implementation of the trace theory in a new model checking tool framework, POEM, that has a strong emphasis on Partial Order Methods. A tree structure is used to sto...
ATVA
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically bas...
ATVA
2006
Springer
13 years 8 months ago
2006
Springer
ATVA
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Much is known about the differences in expressiveness and succinctness between nondeterministic and deterministic automata on infinite words. Much less is known about the...
ATVA
2006
Springer
13 years 8 months ago
2006
Springer
We consider infinite-state discrete Markov chains which are eager: the probability of avoiding a defined set of final states for more than