35 citations · 70 across the 9 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.LO2015★ 35 cited
Approaching the Coverability Problem Continuously
Michael Blondin, Alain Finkel, Christoph Haase +1
The coverability problem for Petri nets plays a central role in the verification of concurrent shared-memory programs. However, its high EXPSPACE-complete complexity poses a challe…
cs.FL2015★ 3 cited
Polynomial Interrupt Timed Automata
Béatrice Bérard, Serge Haddad, Claudine Picaronny +2
Interrupt Timed Automata (ITA) form a subclass of stopwatch automata where reachability and some variants of timed model checking are decidable even in presence of parameters. They…