An Algebra of Deterministic Propositional Acceptance Automata (DPAA) - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

An Algebra of Deterministic Propositional Acceptance Automata (DPAA)

Résumé

Deterministic Propositional Acceptance Automata (DPAA) are proposed to capture system requirements expressing mandatory and forbidden discrete-time behavior. The main feature of this formalism is that it can express the expected behavior when the system is in a particular state. DPAA are therefore blending together state properties, expressed as propo-sitional formulas, and simple discrete-time temporal properties, expressed as mandatory and forbidden actions whenever a given state property holds. They extend modal transition systems to a propositonal setting, where models are Kripke structures, rather than labelled transition systems. Composition operators on DPAA are provided, making them an Interface Theory, with a refinement relation, parallel composition, conjunction and quotient operators. An implicit representation using characteristic functions is also proposed to limit the time/space computational complexity.
Fichier principal
Vignette du fichier
FDL 2020 - DPAA Algebra.pdf (255.24 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02971772 , version 1 (20-10-2020)

Identifiants

  • HAL Id : hal-02971772 , version 1

Citer

Aurélien Lamercerie, Benoît Caillaud. An Algebra of Deterministic Propositional Acceptance Automata (DPAA). FDL 2020 - Forum on specification & Design Languages, Sep 2020, Kiel, Germany. pp.1-8. ⟨hal-02971772⟩
100 Consultations
121 Téléchargements

Partager

Gmail Facebook X LinkedIn More