๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A refinement-based process algebra for timed automata

โœ Scribed by Stefano Cattani; Marta Kwiatkowska

Publisher
Springer
Year
2005
Tongue
English
Weight
283 KB
Volume
17
Category
Article
ISSN
0934-5043

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Categorical foundations for randomly tim
Categorical foundations for randomly timed automata
โœ P. Mateus; M. Morais; C. Nunes; A. Pacheco; A. Sernadas; C. Sernadas ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 498 KB

The general theory of randomly timed automata is developed: starting with the practical motivation and presentation of the envisaged notion, the categorical theory of minimization, aggregation, encapsulation, interconnection and realization of such automata is worked out. All these constructions are

Generalized discrete timed automata: dec
Generalized discrete timed automata: decidable approximations for safety verification
โœ Zhe Dang; Oscar H. Ibarra; Richard A. Kemmerer ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 175 KB

We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look at three approximation techniques (i.e., the r-reset-bounded approximation, the B-bounded approximation, and the B; r -