References of "Mainz, Isabelle"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailAn efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention
Boigelot, Bernard ULiege; Mainz, Isabelle ULiege; Marsault, Victor ULiege et al

in Leibniz International Proceedings in Informatics (2017, August), 80

Given an integer base b>1, a set of integers is represented in base b by a language over {0,1,...,b-1}. The set is said to be b-recognisable if its representation is a regular language. It is known that ... [more ▼]

Given an integer base b>1, a set of integers is represented in base b by a language over {0,1,...,b-1}. The set is said to be b-recognisable if its representation is a regular language. It is known that eventually periodic sets are b-recognisable in every base b, and Cobham's theorem implies the converse: no other set is b-recognisable in every base b. We are interested in deciding whether a $b$-recognisable set of integers (given as a finite automaton) is eventually periodic. Honkala showed that this problem is decidable in 1986 and recent developments give efficient decision algorithms. However, they only work when the integers are written with the least significant digit first. In this work, we consider the natural order of digits (Most Significant Digit First) and give a quasi-linear algorithm to solve the problem in this case. [less ▲]

Detailed reference viewed: 13 (6 ULiège)
Full Text
See detailLes algorithmes : entre quotidien et créativité
Nicolay, Samuel ULiege; Kleyntssens, Thomas ULiege; Mainz, Isabelle ULiege

Conference given outside the academic context (2015)

Detailed reference viewed: 47 (14 ULiège)
Full Text
Peer Reviewed
See detailAcceleration of Affine Hybrid Transformations
Boigelot, Bernard ULiege; Herbreteau, Frédéric; Mainz, Isabelle ULiege

in Lecture Notes in Computer Science (2014), 8837

This work addresses the computation of the set of reachable configurations of linear hybrid automata. The approach relies on symbolic state-space exploration, using acceleration in order to speed up the ... [more ▼]

This work addresses the computation of the set of reachable configurations of linear hybrid automata. The approach relies on symbolic state-space exploration, using acceleration in order to speed up the computation and to make it terminate for a broad class of systems. Our contribution is an original method for accelerating the control cycles of linear hybrid automata, i.e., to compute their unbounded repeated effect. The idea consists in analyzing the data transformations that label these cycles, by reasoning about the geometrical features of the corresponding system of linear constraints. This approach is complete over Multiple Counters Systems (MCS), and is able to accelerate hybrid transformations that are out of scope of existing techniques. [less ▲]

Detailed reference viewed: 95 (32 ULiège)