577 search results - page 14 / 116 » Model Checking Based on Simultaneous Reachability Analysis |
DLOG
2006
13 years 9 months ago
2006
Abstract. Model checking is a fully automated technique for determining whether the behaviour of a finite-state reactive system satisfies a temporal logic specification. Despite th...
FM
2001
Springer
14 years 11 days ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
APN
2007
Springer
14 years 2 months ago
2007
Springer
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In previous work, an automatic ...
CMSB
2006
Springer
13 years 11 months ago
2006
Springer
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 ...
INFOCOM
1997
IEEE
14 years 2 days ago
1997
IEEE
The non-deterministic behaviors in telecommunication services are well-known as one of the most typical Feature Interactions, and they should be detected and eliminated from the t...