3909 search results - page 348 / 782 » Extreme Model Checking |
134
click to vote
FUIN
2008
15 years 4 months ago
2008
The aim of this work is to describe the translation from Intermediate Language, one of the input formalisms of the model checking platform VerICS, to timed automata with discrete d...
119
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
134
Voted
IPL
2007
15 years 4 months ago
2007
We show that the problem of reaching a state set with probability 1 in probabilisticnondeterministic systems operating in parallel is EXPTIME-complete. We then show that this prob...
AI
2004
Springer
15 years 4 months ago
2004
Springer
In this paper, we investigate the extent to which knowledge compilation can be used to improve model checking and inference from propositional weighted bases. We first focus on th...
147
click to vote
MOC
2002
15 years 3 months ago
2002
The mortar technique turns out to be well adapted to handle mesh adaptivity in finite elements, since it allows for working with nonnecessarily compatible discretizations on the el...