6 search results - page 1 / 2 » Improving state class constructions for CTL* model checking ... |
67
Voted
STTT
2008
14 years 8 months ago
2008
CONCUR
2000
Springer
15 years 1 months ago
2000
Springer
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
83
Voted
FORMATS
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. In this paper, we propose a new framework for the parametric verification of time Petri nets with stopwatches controlled by inhibitor arcs. We first introduce an extensio...
DEDS
2006
14 years 10 months ago
2006
In this paper, we propose a method for building the state class graph of a bounded time Petri net (TPN) as a timed automaton (TA), which we call the state class timed automaton. We...
88
Voted
ASPDAC
2007
ACM
15 years 2 months ago
2007
ACM
This paper presents a Boolean based symbolic model checking algorithm for the verification of analog/mixedsignal (AMS) circuits. The systems are modeled in VHDL-AMS, a hardware des...