论文信息 - Comparing detailed and abstract timed models of automated discrete manufacturing systems

Comparing detailed and abstract timed models of automated discrete manufacturing systems

This paper proposes an equivalence relation that permits to compare the external behaviors of two models of the same component of an automated discrete system: a detailed model suitable to design the control of this component and a more abstract model where only the order and the durations of the operations performed by this component are considered. A first definition of the relation is given assuming that both models are deterministic; then a second definition that integrates tolerances on values and time is proposed when this assumption is no more true. These definitions are exemplified on a simple case study.

Matthieu Perin | Jean-Marc Faure

[1] Kim G. Larsen,et al. A Tutorial on Uppaal , 2004, SFM.

[2] Philippe Schnoebelen,et al. Systems and Software Verification, Model-Checking Techniques and Tools , 2001 .

[3] R. V. Glabbeek. The Linear Time-Branching Time Spectrum I The Semantics of Concrete , Sequential ProcessesR , 2007 .

[4] Philippe Schnoebelen,et al. Systems and Software Verification , 2001, Springer Berlin Heidelberg.

[5] Wang Yi,et al. Formal design and analysis of a gear controller , 1998, International Journal on Software Tools for Technology Transfer.

[6] Rajeev Alur,et al. A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[7] Matthieu Perin,et al. Building meaningful timed models of closed-loop DES for verification purposes , 2013 .

[8] Jean-Marc Faure,et al. Building Meaningful Timed Plant Models for Verification Purposes , 2009 .

[9] Benoit Rohee,et al. A methodology to design and check a plant model , 2006 .

[10] Agata Janowska,et al. Slicing of Timed Automata with Discrete Data , 2006, Fundam. Informaticae.