20 search results - page 3 / 4 » SAT Based Bounded Model Checking with Partial Order Semantic... |
ATVA
2006
Springer
13 years 9 months ago
2006
Springer
We present the implementation of the trace theory in a new model checking tool framework, POEM, that has a strong emphasis on Partial Order Methods. A tree structure is used to sto...
FORMATS
2006
Springer
13 years 8 months ago
2006
Springer
Recently, a new approach to the symbolic model checking of timed automata based on a partial order semantics was introduced, which relies on event zones that use vectors of event o...
TCS
2010
13 years 3 months ago
2010
We define a subclass of timed automata, called oscillator timed automata, suitable to model biological oscillators. Coupled biological oscillators may synchronise, as emerging be...
FM
2001
Springer
13 years 9 months 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
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Time Petri nets have proved their interest in modeling realtime concurrent systems. Their usual semantics is defined in term of firing sequences, which can be coded in a ...