#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2002

2008

- This year (0)
- Last 5 years (0)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

In an earlier work [AČJYK00] we presented a general framework for verification of infinite-state transition systems, where the transition relation is monotonic with respect to a well quasi-ordering on the set of states. In this paper, we investigate extending the framework from the context of transition systems to that of games. We show that monotonic games… (More)

- Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso, Mayank Saksena
- International Journal on Software Tools for…
- 2004

Regular model checking is a form of symbolic model checking for parameterized and infinite-state systems whose states can be represented as words of arbitrary length over a finite alphabet, in which regular sets of words are used to represent sets of states. We present LTL(MSO), a combination of the logics monadic second-order logic (MSO) and LTL as a… (More)

- Parosh Aziz Abdulla, Axel Legay, Julien d'Orso, Ahmed Rezine
- TACAS
- 2005

Regular model checking is the name of a family of techniques for analyzing infinite-state systems in which states are represented by words, sets of states by finite automata, and transitions by finite-state transducers. The central problem is to compute the transitive closure of a transducer. A main obstacle is that the set of reachable states is in general… (More)

- Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso
- CONCUR
- 2002

- Parosh Aziz Abdulla, Axel Legay, Julien d'Orso, Ahmed Rezine
- J. Log. Algebr. Program.
- 2006

Regular model checking is the name of a family of techniques for analyzing infinitestate systems in which states are represented by words, sets of states by finite automata, and transitions by finite-state transducers. In this framework, the central problem is to compute the transitive closure of a transducer. Such a representation allows to compute the set… (More)

- Parosh Aziz Abdulla, Ahmed Bouajjani, Julien d'Orso
- J. Log. Comput.
- 2008

In an earlier work [Abdulla et al. (2000, Information and Computation, 160, 109–127)] we presented a general framework for verification of infinite-state transition systems, where the transition relation is monotonic with respect to a well quasi-ordering on the set of states. In this article, we investigate extending the framework from the context of… (More)

- Julien d'Orso, Tayssir Touili
- IFIP TCS
- 2006

We extend the regular model checking framework so that it can handle systems with arbitrary width tree-like structures. Configurations of a system are represented by trees of arbitrary arities, sets of configurations are represented by regular hedge automata, and the dynamics of a system is modeled by a regular hedge transducer. We consider the problem of… (More)

- Julien d'Orso
- 2003