Efficient On-the-Fly Algorithms for the Analysis of Timed Games

By F. Cassez, Alexandre David, E. Fleury, Kim Guldstrand Larsen, D. Lime. International Conference on Concurrency Theory, 2005

365 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets (2008, background): “For example in the theory of TA there has been recently lots of research on extending timed automata with price/cost [60, 8, 28] and studying timed games [64, 39, 13, 12] as well as on-line testing [56, 61].”
Contracts for System Design (2018, methodology): “Examples are the Scade Suite Design Verifier7 and Simulink Design Verifier [248], which are both based on the Prover Technology proof engine [239, 240], the products of PikeTec8 such as TPT, the tool AGATHA [55] developed at CEA/LIST and Uppaal [34] with its derivatives like Uppaal TIGA [77] and ECD”
Model Checking Real-Time Systems (2018, neutral): “ness checking [147, 151], model checking with respect to TCTL [47], time-abstract bisimulation checking [149], and controller synthesis for timed game automata [69].”