48 citations · 207 across the 23 of their papers we have counts for
12 papers · 1 filter
Branch-Well-Structured Transition Systems and Extensions
Benedikt Bollig, Alain Finkel, Amrita Suresh
We propose a relaxation to the definition of well-structured transition systems (\WSTS) while retaining the decidability of boundedness and non-termination. In this class, the well…
Coverability, Termination, and Finiteness in Recursive Petri Nets
Alain Finkel, Serge Haddad, Igor Khmelnitsky
In the early two-thousands, Recursive Petri nets have been introduced in order to model distributed planning of multi-agent systems for which counters and recursivity were necessar…
Bounded Reachability Problems are Decidable in FIFO Machines
Benedikt Bollig, Alain Finkel, Amrita Suresh
The undecidability of basic decision problems for general FIFO machines such as reachability and unboundedness is well-known. In this paper, we provide an underapproximation for th…
From Well Structured Transition Systems to Program Verification
Alain Finkel
We describe the use of the theory of WSTS for verifying programs.
Forward Analysis for WSTS, Part III: Karp-Miller Trees
Michael Blondin, Alain Finkel, Jean Goubault-Larrecq
This paper is a sequel of "Forward Analysis for WSTS, Part I: Completions" [STACS 2009, LZI Intl. Proc. in Informatics 3, 433-444] and "Forward Analysis for WSTS, Part II: Complete…
Well Behaved Transition Systems
Michael Blondin, Alain Finkel, Pierre McKenzie
The well-quasi-ordering (i.e., a well-founded quasi-ordering such that all antichains are finite) that defines well-structured transition systems (WSTS) is shown not to be the weak…