21 citations · 40 across the 12 of their papers we have counts for
4 papers · 1 filter
Random Generation and Enumeration of Accessible Determinisitic Real-time Pushdown Automata
Pierre-Cyrille Héam, Jean-Luc Joly
This papers presents a general framework for the uniform random generation of deterministic real-time accessible pushdown automata. A polynomial time algorithm to randomly generate…
On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism
Pierre-Cyrille Heam, Jean-Luc Joly
In this paper we address the problem of the uniform random generation of non deterministic automata (NFA) up to isomorphism. First, we show how to use a Monte-Carlo approach to uni…
The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard
P. -C Héam, V. Hugot, O. Kouchnarenko
The model of tree automata with equality and disequality constraints was introduced in 2007 by Filiot, Talbot and Tison. In this paper we show that if there is at least one disequa…
Enhancing Approximations for Regular Reachability Analysis
Alois Dreyfus, Pierre-Cyrille Heam, Olga Kouchnarenko
This paper introduces two mechanisms for computing over-approximations of sets of reachable states, with the aim of ensuring termination of state-space exploration. The first mecha…