From Stochastic Automat to Timed Automata: Abstracting probability in a Compositional manner

TitleFrom Stochastic Automat to Timed Automata: Abstracting probability in a Compositional manner
Publication TypeConference Paper
Year of Publication2003
AuthorsD'Argenio, PR
EditorFiore, M, Fridlender, D
Conference NameProceedings of the Argentinian Workshop on Theoretical Computer Science, WAIT 2003. Associated to the 32 JAIIO. {\rm Buenos Aires, Argentina, September 1-5, 2003}
PublisherSADIO
AbstractWe present a translation from stochastic automata to timed automata with deadlines. The translation abstracts probabilities and preserves trace behaviour. Moreover, it is compositional in the sense that the translation of the prallel composition of two stochastic automata is equivalent to the parallel composition of the timed automata resulting from the translation of each component.
PDF (Full text):