Isabelle Mainz

  • Citations Per Year
Learn 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(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(More)
  • 1