48 citations · 56 across the 3 of their papers we have counts for
3 papers
cs.LO2009★ 48 cited
Forward analysis for WSTS, Part I: Completions
Alain Finkel, Jean Goubault-Larrecq
Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute…
cs.LO2008★ 4 cited
Decomposition of Decidable First-Order Logics over Integers and Reals
Florent Bouchy, Alain Finkel, Jérôme Leroux
We tackle the issue of representing infinite sets of real- valued vectors. This paper introduces an operator for combining integer and real sets. Using this operator, we decompose…
cs.CG2008★ 4 cited
The convex hull of a regular set of integer vectors is polyhedral and effectively computable
Alain Finkel, Jérôme Leroux
Number Decision Diagrams (NDD) provide a natural finite symbolic representation for regular set of integer vectors encoded as strings of digit vectors (least or most significant di…