No. Title Author Year
1 Revisiting Local Time Semantics for Networks of Timed Automata Govind, R. et al. 2019
2 Reachability in Timed Automata with Diagonal Constraints Gastin, Paul et al. 2018
3 Nesting Depth of Operators in Graph Database Queries: Expressiveness vs. Evaluation Complexity Praveen, M. et al. 2016
4 Why Liveness for Timed Automata Is Hard, and What We Can Do About It Herbreteau, Frédéric et al. 2016
5 Using non-convex approximations for efficient analysis of timed automata Herbreteau, Frédéric et al. 2011
Current Page :
Number of result pages: 1
Number of documents: 5


DROPS-Home | Imprint | Privacy Published by LZI