Describing and Executing Random Reactive Systems
Résumé
We propose a operational model for describing non-deterministic reactive systems, together with a mechanism for expressing probability issues. Some models have already been proposed for this purposes, but they are generally intended to allow global reasoning on systems (e.g. stockastic analysis, formal proofs). Our goal is somehow less ambitious, sinve we are mainly interested in executing such models, which can be useful for testing, prototyping. On the other hand, the proposed model is not strongly restricted because of decidability concerns, so it is likely to be more expressive: in particular, we are not restricted to finite-state models. The proposed model is rather general: systems are described as implicit state/transition machines, possibly infinite , where probabilities are expressed by means of relative weights. The model itself is more an abstract machine than a programming language. The idea is then to propose high-level, user-friendly languages that can be compiled into the model. We present such a language, based on regular expressions , together with its translation into the model.
Domaines
Langage de programmation [cs.PL]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...