Isabel Demongodin - Academia.edu (original) (raw)
Uploads
Papers by Isabel Demongodin
Engineering Applications of Artificial Intelligence, Apr 1, 2008
Identification of a final state after red a test is one of the fundamental testing problems for d... more Identification of a final state after red a test is one of the fundamental testing problems for discrete event systems and synchronizing sequences represents a conventional solution to this problem. In this paper, we consider systems modeled by a special class of synchronized Petri nets, called 1-place-unbounded, that contain a single unbounded place. The infinite reachability spaces of such nets can be characterized by two types of finite graphs, called improved modified coverability graph and weighted automata with safety conditions. In case these two finite graphs are deterministic, we develop novel computation algorithms for synchronizing sequences for this class of nets by decomposing the finite graphs into strongly connected components.
Discrete Event Dynamic Systems, Feb 20, 2016
Nonlinear Analysis: Hybrid Systems, May 1, 2014
IFAC Proceedings Volumes, Sep 1, 2013
IFAC Proceedings Volumes, 2012
IFAC Proceedings Volumes, 2010
HAL (Le Centre pour la Communication Scientifique Directe), Nov 5, 2014
HAL (Le Centre pour la Communication Scientifique Directe), 2014
HAL (Le Centre pour la Communication Scientifique Directe), Mar 1, 2013
no abstrac
arXiv (Cornell University), Jul 9, 2013
IFAC Proceedings Volumes, 2009
Recently, there has been a growing interest in the modelling and analysis of dynamic hybrid syste... more Recently, there has been a growing interest in the modelling and analysis of dynamic hybrid systems. The possibility of associating both discrete events and continuous time behaviour in the same formalism has generated a considerable interest in the Petri net paradigm. A central issue in this field is the concept of hybrid Petri net which consists in continuous transitions and
ABSTRACT In basic testing problems, a topic of great interest is that of state identification. St... more ABSTRACT In basic testing problems, a topic of great interest is that of state identification. State identification has been solved by the way of synchronizing sequences, i.e., sequences that drive the system to a unique final state regardless of the initial one and do not require the observation of the system’s outputs. In this paper we provide a novel approach for the computation of synchronizing sequences on discrete event systems modeled by synchronized Petri nets. This approach is compared with our previous results for synchronizing sequence computation by means of two different benchmarks. First, we generate random nets, second we provide a parametric manufacturing system.
HAL (Le Centre pour la Communication Scientifique Directe), Feb 1, 2014
no abstrac
HAL (Le Centre pour la Communication Scientifique Directe), Apr 3, 2006
National audienc
Lecture Notes in Computer Science, 2020
International audienc
Engineering Applications of Artificial Intelligence, Apr 1, 2008
Identification of a final state after red a test is one of the fundamental testing problems for d... more Identification of a final state after red a test is one of the fundamental testing problems for discrete event systems and synchronizing sequences represents a conventional solution to this problem. In this paper, we consider systems modeled by a special class of synchronized Petri nets, called 1-place-unbounded, that contain a single unbounded place. The infinite reachability spaces of such nets can be characterized by two types of finite graphs, called improved modified coverability graph and weighted automata with safety conditions. In case these two finite graphs are deterministic, we develop novel computation algorithms for synchronizing sequences for this class of nets by decomposing the finite graphs into strongly connected components.
Discrete Event Dynamic Systems, Feb 20, 2016
Nonlinear Analysis: Hybrid Systems, May 1, 2014
IFAC Proceedings Volumes, Sep 1, 2013
IFAC Proceedings Volumes, 2012
IFAC Proceedings Volumes, 2010
HAL (Le Centre pour la Communication Scientifique Directe), Nov 5, 2014
HAL (Le Centre pour la Communication Scientifique Directe), 2014
HAL (Le Centre pour la Communication Scientifique Directe), Mar 1, 2013
no abstrac
arXiv (Cornell University), Jul 9, 2013
IFAC Proceedings Volumes, 2009
Recently, there has been a growing interest in the modelling and analysis of dynamic hybrid syste... more Recently, there has been a growing interest in the modelling and analysis of dynamic hybrid systems. The possibility of associating both discrete events and continuous time behaviour in the same formalism has generated a considerable interest in the Petri net paradigm. A central issue in this field is the concept of hybrid Petri net which consists in continuous transitions and
ABSTRACT In basic testing problems, a topic of great interest is that of state identification. St... more ABSTRACT In basic testing problems, a topic of great interest is that of state identification. State identification has been solved by the way of synchronizing sequences, i.e., sequences that drive the system to a unique final state regardless of the initial one and do not require the observation of the system’s outputs. In this paper we provide a novel approach for the computation of synchronizing sequences on discrete event systems modeled by synchronized Petri nets. This approach is compared with our previous results for synchronizing sequence computation by means of two different benchmarks. First, we generate random nets, second we provide a parametric manufacturing system.
HAL (Le Centre pour la Communication Scientifique Directe), Feb 1, 2014
no abstrac
HAL (Le Centre pour la Communication Scientifique Directe), Apr 3, 2006
National audienc
Lecture Notes in Computer Science, 2020
International audienc