Computing Approximations of Linear Transition Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2003

Computing Approximations of Linear Transition Systems


Transition systems have been intensively applied to the modelling of complex systems. Their safety properties can be verified using model-checking procedures by iterative computation of fixed points. The approach has to face two main difficulties: the complexity of computations on the data domain and the termination of the iterative algorithm. In many cases an analysis of the transition system can be exploited in order to speed up the calculus. Metatransitions are upper approximations of transition relations: they lead in one step to a superset of the states occuring on an infinite trajectory. Using polynomials we compute metatransitions for linear transition systems. We apply this method to a train controller.
Fichier principal
Vignette du fichier
RR-4774.pdf (344.15 Ko) Télécharger le fichier

Dates and versions

inria-00071812 , version 1 (23-05-2006)


  • HAL Id : inria-00071812 , version 1


Julien Musset, Michaël Rusinowitch. Computing Approximations of Linear Transition Systems. [Research Report] RR-4774, INRIA. 2003, pp.20. ⟨inria-00071812⟩
110 View
184 Download


Gmail Facebook Twitter LinkedIn More