Add to ORKGWe study a class of extended automata defined by guarded commands over Presburger arithmetic with uninterpreted functions. On the theoretical side, we show that the bounded reachability problem is decidable in this model. On the practical side, the class is useful for modeling programs with potentially infinite data structures, and the reachability procedure can be used for symbolic simulation, testing, and verification
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets o...
We revisit a fundamental result in real-time verification, namely that the binary reachability relat...
International audienceWe define the class of explorable automata on finite or infinite words. This i...
We study a class of extended automata defined by guarded commands over Presburger arithmetic with un...
AbstractWe study a class of extended automata defined by guarded commands over Presburger arithmetic...
We define a symbolic determinisation procedure for a class of infinite-state systems, which consists...
. We present in this paper a method combining path decomposition and bottom-up computation features ...
Systems ofData Management Timed Automata(SDMTAs) are networks of communicating timed automata with s...
AbstractOver the last few years there has been an increasing research effort directed towards the au...
International audienceParikh automata extend finite automata by counters that can be tested for memb...
We address the problem of verifying safety and liveness properties for infinite-state systems, using...
AbstractWe consider the verification problem of a class of infinite-state systems called wPAD. These...
International audienceThreshold automata, and the counter systems they define, were introduced as a ...
We are interested here in formal verification of systems. More exactly we want to compute the reacha...
(Extended Abstract) ∗ We study decidability and complexity issues for fragments of LTL with Presburg...
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets o...
We revisit a fundamental result in real-time verification, namely that the binary reachability relat...
International audienceWe define the class of explorable automata on finite or infinite words. This i...
We study a class of extended automata defined by guarded commands over Presburger arithmetic with un...
AbstractWe study a class of extended automata defined by guarded commands over Presburger arithmetic...
We define a symbolic determinisation procedure for a class of infinite-state systems, which consists...
. We present in this paper a method combining path decomposition and bottom-up computation features ...
Systems ofData Management Timed Automata(SDMTAs) are networks of communicating timed automata with s...
AbstractOver the last few years there has been an increasing research effort directed towards the au...
International audienceParikh automata extend finite automata by counters that can be tested for memb...
We address the problem of verifying safety and liveness properties for infinite-state systems, using...
AbstractWe consider the verification problem of a class of infinite-state systems called wPAD. These...
International audienceThreshold automata, and the counter systems they define, were introduced as a ...
We are interested here in formal verification of systems. More exactly we want to compute the reacha...
(Extended Abstract) ∗ We study decidability and complexity issues for fragments of LTL with Presburg...
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets o...
We revisit a fundamental result in real-time verification, namely that the binary reachability relat...
International audienceWe define the class of explorable automata on finite or infinite words. This i...
