Sciweavers

19 search results - page 1 / 4
» Modular System Verification by Inference, Testing and Reacha...
Sort
View
PTS
2008
98views Hardware» more  PTS 2008»
13 years 5 months ago
Modular System Verification by Inference, Testing and Reachability Analysis
Verification of a modular system composed of communicating components is a difficult problem, especially when the models of the components are not available. Conventional testing t...
Roland Groz, Keqin Li 0002, Alexandre Petrenko, Mu...
CAV
2003
Springer
140views Hardware» more  CAV 2003»
13 years 8 months ago
Rabbit: A Tool for BDD-Based Verification of Real-Time Systems
Thispapergivesashort overviewofa model checking tool forreal-time systems. The modeling language are timed automata extended with concepts for modular modeling. The tool provides r...
Dirk Beyer, Claus Lewerentz, Andreas Noack
CMSB
2006
Springer
13 years 8 months ago
Compositional Reachability Analysis of Genetic Networks
Genetic regulatory networks have been modeled as discrete transition systems by many approaches, benefiting from a large number of formal verification algorithms available for the ...
Gregor Gößler
IJFCS
2008
81views more  IJFCS 2008»
13 years 4 months ago
Reachability Analysis in Verification via Supercompilation
Abstract. We present an approach to verification of parameterized systems, which is based on program transformation technique known as supercompilation. In this approach the statem...
Alexei Lisitsa, Andrei P. Nemytykh
DAC
1996
ACM
13 years 8 months ago
Efficient Partial Enumeration for Timing Analysis of Asynchronous Systems
-- This paper presents an efficient method for the timing verification of concurrent systems, modeled as labeled Timed Petri nets. The verification problems we consider require us ...
Eric Verlind, Gjalt G. de Jong, Bill Lin