𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Categorical foundations for randomly timed automata

✍ Scribed by P. Mateus; M. Morais; C. Nunes; A. Pacheco; A. Sernadas; C. Sernadas

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
498 KB
Volume
308
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

✦ Synopsis

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 presented universally: minimization and realization as adjunctions, aggregation as product, interconnection as cartesian lifting, and encapsulation as co-cartesian lifting. Stochastic timed automata are shown to be a particular case of randomly timed automata. The notion of stochastic timed automaton is shown to be too restrictive to establish a self contained theory of combination and realization.

πŸ“œ SIMILAR VOLUMES

Extending Timed Automata for Composition
Extending Timed Automata for Compositional Modeling Healthy Timed Systems
✍ VΓ­ctor Braberman; Alfredo Olivero πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 382 KB

We introduce the notion of Timed I/O Components as Timed Automata "Γ  la" Alur \& Dill where an "admissible" I/O interface is declared. That notion has, what we consider, a key modeling property: non-zeno preservation under syntacticallycheckable "I/O compatibility" among interacting components. Also

The power of reachability testing for ti
The power of reachability testing for timed automata
✍ Luca Aceto; Patricia Bouyer; Augusto BurgueΓ±o; Kim G Larsen πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 824 KB

The computational engine of the veriΓΏcation tool UPPAAL consists of a collection of e cient algorithms for the analysis of reachability properties of systems. Model-checking of properties other than plain reachability ones may currently be carried out in such a tool as follows. Given a property to m

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 -