Alain Finkel

Latest

• The Reachability Problem for Two-Dimensional Vector Addition Systems with States
• The Logical View on Continuous Petri Nets
• Approaching the Coverability Problem Continuously
• Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete
• Reachability in Register Machines with Polynomial Updates