Yann Thierry-Mieg

Yann Thierry-Mieg

Auto-generated profile, based on publicly available information

Yann Thierry-Mieg

Sorbonne Université, CNRS, LIP6

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2015
Verified
Book Chapter
Closed access
PDF file
YTYann Thierry-Mieg
Yann Thierry-Mieg

1 January 2005
Verified
Book Chapter
Open access
PDF file
JCJean-Michel Couvreur
Jean-Michel Couvreur
YTYann Thierry-Mieg
Yann Thierry-Mieg
Symbolic model-checking using binary decision diagrams (BDD) can allow to represent very large state spaces. BDD give good results for synchronous systems, particularly for circuits that are well adapted to a binary encoding of a state. However both the operation definition mechanism (using more BDD) and the state representation (purely linear traversal from root to leaves) show their limits when trying to tackle globally asynchronous and typed specifications. Data Decision Diagrams (DDD) [7] are a directed acyclic graph structure that manipulates(a priori unbounded) integer domain variables, and which offers a flexible and compositional definition of operations through inductive homomorphisms. We first introduce a new transitive closure unary operator for homomorphisms, that heavily reduces the intermediate peak size effect common to symbolic approaches. We then extend the DDD definition to introduce hierarchy in the data structure. We define Set Decision Diagrams, in which a variable’s domain is a set of values. Concretely, it means the arcs of an SDD may be labeled with an SDD (or a DDD), introducing the possibility of arbitrary depth nesting in the data structure. We show how this data structure and operation framework is particularly adapted to the computation and representation of structured state-spaces, and thus shows good potential for symbolic model-checking of software systems, a problem that is difficult for plain BDD representations.

15 April 2016 in Distributed Computing
Verified
Journal Article
Closed access
PDF file
BBBéatrice Bérard
Béatrice Bérard
PLPascal Lafourcade
Pascal Lafourcade
LMLaure Millet
Laure Millet
MPMaria Potop-Butucaru
Maria Potop-Butucaru
YTYann Thierry-Mieg
Yann Thierry-Mieg
STSébastien Tixeuil
Sébastien Tixeuil

1 January 2012
Verified
Book Chapter
Closed access
PDF file
FKFabrice Kordon
Fabrice Kordon
ALAlban Linard
Alban Linard
DBDidier Buchs
Didier Buchs
MCMaximilien Colange
Maximilien Colange
SESami Evangelista
Sami Evangelista
HWHarro Wimmel
Harro Wimmel

1 January 2009 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
YTYann Thierry-Mieg
Yann Thierry-Mieg
DPDenis Poitrenaud
Denis Poitrenaud
AHAlexandre Hamez
Alexandre Hamez
FKFabrice Kordon
Fabrice Kordon

26 August 2008 in Innovations in Systems and Software Engineering
Verified
Journal Article
Closed access
PDF file
YTYann Thierry-Mieg
Yann Thierry-Mieg
LHLom-Messan Hillah
Lom-Messan Hillah