38 search results - page 1 / 8 » Formal verification of LTL formulas for SystemC designs |
ISCAS
2003
IEEE
13 years 10 months ago
2003
IEEE
To handle today’s complexity, modern circuits and systems be specified at a high level of abstraction. Recently, SystemC has been proposed as a language that allows a fast on o...
ICWE
2005
Springer
13 years 10 months ago
2005
Springer
As the Web becomes a platform for implementing complex B2C and B2B applications, there is a need to extend Web conceptual modeling to process-centric applications. In this context,...
FMICS
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
ECAI
2010
Springer
13 years 2 months ago
2010
Springer
The language of linear temporal logic (LTL) has been proposed as a formalism for specifying temporally extended goals and search control constraints in planning. However, the seman...
TII
2010
12 years 11 months ago
2010
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (ContPNs). Specifically, we consider two problems: (1) given an initial set ...