56 search results - page 1 / 12 » Efficient Symbolic State-Space Construction for Asynchronous... |
APN
2000
Springer
13 years 8 months ago
2000
Springer
Many techniques for the verification of reactive systems rely on the analysis of their reachable state spaces. In this paper, a new algorithm for the symbolic generation of the sta...
SOFSEM
2009
Springer
14 years 1 months ago
2009
Springer
We propose a new type of canonical decision diagrams, which allows a more efficient symbolic state-space generation for general asynchronous systems by allowing on-the-fly extensi...
FMICS
2008
Springer
13 years 6 months ago
2008
Springer
Different approaches have been developed to mitigate the state space explosion of model checking techniques. Among them, symbolic verification techniques use efficient representati...
DAC
1996
ACM
13 years 8 months ago
1996
ACM
-- 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 ...
ETT
2000
13 years 4 months ago
2000
Spread spectrum multi-carrier multiple access (SS-MC-MA) systems exploit in a similar manner as MC-CDMA systems the advantages of the diversity gain due to the spread spectrum tech...