Sébastien Chédor

  • Citations Per Year
Learn More
The analysis of discrete event systems under partial observation is an important topic, with major applications such as the detection of information flow and the diagnosis of faulty behaviors. We consider recursive tile systems, which are infinite systems generated by a finite collection of finite tiles, a simplified variant of deterministic graph grammars.(More)
<lb>An effective way to ensure the proper functioning of a computer system is to represent it<lb>by using mathematical models . Many studies have been conducted using finite automata as<lb>models, in this thesis we try to extend these works to infinite models.<lb>We focus on three problems in which a system is partially observed. In this case, it(More)
In this paper we explore the generation of conformance test cases for Recursive Tile Systems (RTSs) in the framework of the classical ioco testing theory. The RTS model allows the description of reactive systems with recursion, and is very similar to other models like Pushdown Automata, Hyperedge Replacement Grammars or Recursive State Machines. Test(More)
  • 1