No. Title Author Year
1 Revisiting Local Time Semantics for Networks of Timed Automata Govind, R. et al. 2019
2 Deciding the Topological Complexity of Büchi Languages Skrzypczak, Michal et al. 2016
3 Soundness in Negotiations Esparza, Javier 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 A Model for Behavioural Properties of Higher-order Programs Salvati, Sylvain et al. 2015
6 Ordered Tree-Pushdown Systems Clemente, Lorenzo et al. 2015
7 Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable La Torre, Salvatore et al. 2015
8 Distributed Synthesis for Acyclic Architectures Muscholl, Anca et al. 2014
9 Evaluation is MSOL-compatible Salvati, Sylvain et al. 2013
10 Using non-convex approximations for efficient analysis of timed automata Herbreteau, Frédéric et al. 2011
Current Page :
Number of result pages: 2
Number of documents: 12


DROPS-Home | Imprint | Privacy Published by LZI