28 search results - page 2 / 6 » Reachability Analysis for Formal Verification of SystemC |
82
Voted
CMSB
2006
Springer
15 years 1 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 ...
COMCOM
1998
14 years 9 months ago
1998
In this paper, we propose a new formalism, named the Timed Communicating Finite State Machine (Timed CFSM), for specifying and verifying time-critical systems. Timed CFSM preserve...
FORTE
2009
14 years 7 months ago
2009
Abstract. We propose a verification method for parameterized systems with global conditions. The method is based on context-sensitive constraints, a symbolic representation of infi...
ICMCS
2000
IEEE
15 years 1 months ago
2000
IEEE
This paper presents a formal approach based on the RTLOTOS formal description technique for the semantic verification of SMIL documents. The reachability analysis of RT-LOTOS spec...
137
click to vote
AGTIVE
2007
Springer
15 years 1 months ago
2007
Springer
On the basis of a case-study, we demonstrate the usefulness of topology invariants for model-driven systems development. Considering a graph grammar semantics for a relevant fragme...