211 citations
- Université Grenoble AlpesFR49 papers
- Centre National de la Recherche ScientifiqueFR44 papers
- Institut polytechnique de GrenobleFR12 papers
- Université Joseph FourierFR7 papers
- FortissDE4 papers
- Institut des langues et cultures d'Europe, Amérique, Afrique, Asie et AustralieFR4 papers
- Institut national de recherche en sciences et technologies du numériqueFR4 papers
- Aalto UniversityFI3 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR3 papers
- École Polytechnique Fédérale de LausanneCH3 papers
- Laboratoire d'Informatique de GrenobleFR3 papers
- LIP6FR3 papers
10 papers · 1 filter
Regular Grammars for Sets of Graphs of Tree-Width 2
Marius Bozga, Radu Iosif, Florian Zuleger
Regular word grammars are restricted context-free grammars that define all the recognizable languages of words. This paper generalizes regular grammars from words to certain classe…
Characterizations of Monadic Second Order Definable Context-Free Sets of Graphs
Radu Iosif, Florian Zuleger
We give a characterization of the sets of graphs that are both definable in Counting Monadic Second Order Logic (CMSO) and context-free, i.e., least solutions of Hyperedge-Replacem…
Towards Efficient Active Learning of PDFA
Franz Mayr, Sergio Yovine, Federico Pan +2
We propose a new active learning algorithm for PDFA based on three main aspects: a congruence over states which takes into account next-symbol probability distributions, a quantiza…
Quantitative Corner Case Feature Analysis of Hybrid Automata with ForFET
Antonio Anastasio Bruto da Costa, Pallab Dasgupta, Nikolaos Kekatos
The analysis and verification of hybrid automata (HA) models against rich formal properties can be a challenging task. Existing methods and tools can mainly reason whether a given…
Structural Invariants for Parametric Verification of Systems with Almost Linear Architectures
Marius Bozga, Radu Iosif, Joseph Sifakis
We consider concurrent systems consisting of a finite but unknown number of components, that are replicated instances of a given set of finite state automata. The components commun…
First Order Alternation
Radu Iosif, Xiao Xu
We introduce first order alternating automata, a generalization of boolean alternating automata, in which transition rules are described by multisorted first order formulae, with s…