arXiv subjects

Jean-Baptiste Raclet

Publications and source records attributed to Jean-Baptiste Raclet.

5 recordsLinked to original sources

arXiv2022

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

Graphical models in probability and statistics are a core concept in the area of probabilistic reasoning and probabilistic programming-graphical models include Bayesian networks and factor graphs. In this paper we develop a new model of mixed (nondeterministic/probabilistic) automata that subsumes both nondeterministic automata and graphical probabilistic models. Mixed Automata are equipped with parallel composition, simulation relation, and support message passing algorithms inherited from graphical probabilistic models. Segala's Probabilistic Automatacan be mapped to Mixed Automata.

cs.AI↗

arXiv2020

Mixed Nondeterministic-Probabilistic Interfaces

Interface theories are powerful frameworks supporting incremental and compositional design of systems through refinements and constructs for conjunction, and parallel composition. In this report we present a first Interface Theor -- |Modal Mixed Interfaces -- for systems exhibiting both non-determinism and randomness in their behaviour. The associated component model -- Mixed Markov Decision Processes -- is also novel and subsumes both ordinary Markov Decision Processes and Probabilistic Automata.

cs.LO↗

arXiv2015

On the Complexity of Flanked Finite State Automata

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 properties while preserving the succinctness of nondeterministic automata. In particular, we show that the universality problem for FFA is in linear time and that language inclusion can be checked in polynomial time. A useful application of FFA is to provide an efficient way to compute the quotient and inclusion of regular languages without the need to use the powerset construction. These operations are the building blocks of several verification algorithms.

cs.FL↗

arXiv2014

Quotient of Acceptance Specifications under Reachability Constraints

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 design. In this paper, we consider a specification theory based on marked acceptance specifications (MAS) which are automata enriched with variability information encoded by acceptance sets and with reachability constraints on states. We define a sound and complete quotient for MAS hence ensuring reachability properties by construction.

cs.FL↗

arXiv2012

Proceedings Fourth Workshop on Foundations of Interface Technologies

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 place on March 25, 2012. The aim of this workshop is to bring together researchers who are interested in the formal underpinnings of interface technologies.

cs.LO↗