4 citations · 5 across the 3 of their papers we have counts for
3 papers
cs.LO2022★ 4 cited
Zone-based verification of timed automata: extrapolations, simulations and what next?
Patricia Bouyer, Paul Gastin, Frédéric Herbreteau +2
Timed automata have been introduced by Rajeev Alur and David Dill in the early 90's. In the last decades, timed automata have become the de facto model for the verification of real…
cs.DB2014
Defining relations on graphs: how hard is it in the presence of node partitions?
M. Praveen, B. Srivathsan
Designing query languages for graph structured data is an active field of research. Evaluating a query on a graph results in a relation on the set of its nodes. In other words, a q…
cs.LO2014★ 1 cited
Fast detection of cycles in timed automata
Aakash Deshpande, Frédéric Herbreteau, B. Srivathsan +2
We propose a new efficient algorithm for detecting if a cycle in a timed automaton can be iterated infinitely often. Existing methods for this problem have a complexity which is ex…