Searching for authors named "Gilles Geeraerts" – sorted by Relevance.
-
Expand, Enlarge and Check. . . Made Efficient
- The coverability problem is decidable for the class of well-structured transition systems. Until recently, the only known algorithm to solve this problem was based on symbolic backward reachability. In a recent paper, we have introduced the theory underlying a new algorithmic solution, called `E
- Cited by 3 (2 self) – Add To MetaCart

