activity
20122022
most citedOn the Complexity of Flanked Finite State Automata

1 citations · 1 across the 5 of their papers we have counts for

collaborators

5 papers

cs.AI2022

Mixed Nondeterministic-Probabilistic Automata: Blending graphical probabilistic models with nondeterminism

Albert Benveniste, Jean-Baptiste Raclet

Graphical models in probability and statistics are a core concept in the area of probabilistic reasoning and probabilistic programming-graphical models include Bayesian networks an…

cs.LO2020

Mixed Nondeterministic-Probabilistic Interfaces

Albert Benveniste, Kim Larsen, Jean-Baptiste Raclet

Interface theories are powerful frameworks supporting incremental and compositional design of systems through refinements and constructs for conjunction, and parallel composition.…

cs.FL2015★ 1 cited

On the Complexity of Flanked Finite State Automata

Florent Avellaneda, Silvano Dal Zilio, Jean-Baptiste Raclet

We define a new subclass of nondeterministic finite automata for prefix-closed languages called Flanked Finite Automata (FFA). We show that this class enjoys good complexity proper…

cs.FL2014

Quotient of Acceptance Specifications under Reachability Constraints

Guillaume Verdier, Jean-Baptiste Raclet

The quotient operation, which is dual to the composition, is crucial in specification theories as it allows the synthesis of missing specifications and thus enables incremental des…

cs.LO2012

Proceedings Fourth Workshop on Foundations of Interface Technologies

Sebastian Bauer, Jean-Baptiste Raclet

This volume contains the proceedings of the 4th workshop on Foundations of Interface Technologies (FIT 2012) which was collocated with ETAPS 2012 in Tallinn, Estonia, and took plac…