333 search results - page 1 / 67 » On the complexity of partial order trace model checking |
IPL
2008
13 years 4 months ago
2008
CIE
2008
Springer
13 years 5 months ago
2008
Springer
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
ATVA
2006
Springer
13 years 8 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...
FUIN
2007
13 years 4 months ago
2007
Mazurkiewicz traces form a model for concurrency. Temporal logic st-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical prop...
ATVA
2004
Springer
13 years 10 months ago
2004
Springer
This paper proposes a partial order reduction algorithm for timed trace theoretic verification in order to detect both safety failures and timing failures of timed circuits effic...