Sciweavers

Share
ATVA
2006
Springer
131views Hardware» more  ATVA 2006»
10 years 3 months ago
Timed Unfoldings for Networks of Timed Automata
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...
Patricia Bouyer, Serge Haddad, Pierre-Alain Reynie...
ATVA
2006
Springer
83views Hardware» more  ATVA 2006»
10 years 3 months ago
A Fresh Look at Testing for Asynchronous Communication
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...
Puneet Bhateja, Paul Gastin, Madhavan Mukund
ATVA
2006
Springer
130views Hardware» more  ATVA 2006»
10 years 3 months ago
The Implementation of Mazurkiewicz Traces in POEM
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...
Peter Niebert, Hongyang Qu
ATVA
2006
Springer
153views Hardware» more  ATVA 2006»
10 years 3 months ago
Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
Abstract. Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically bas...
Wonhong Nam, Rajeev Alur
ATVA
2006
Springer
87views Hardware» more  ATVA 2006»
10 years 3 months ago
Timed Temporal Logics for Abstracting Transient States
Houda Bel Mokadem, Béatrice Bérard, ...
ATVA
2006
Springer
121views Hardware» more  ATVA 2006»
10 years 3 months ago
On the Succinctness of Nondeterminism
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...
Benjamin Aminof, Orna Kupferman
ATVA
2006
Springer
82views Hardware» more  ATVA 2006»
10 years 3 months ago
Eager Markov Chains
We consider infinite-state discrete Markov chains which are eager: the probability of avoiding a defined set of final states for more than
Parosh Aziz Abdulla, Noomene Ben Henda, Richard Ma...
books