Verifiable Decisions in Autonomous Concurrent Systems - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Verifiable Decisions in Autonomous Concurrent Systems

Résumé

Being able to take decisions at runtime is a crucial ability for any system that is designed to act autonomously in uncertain or even unknown environments. This autonomy necessitates to formally check system properties at design time to ensure avoidance of problems or even harm caused by the system at runtime. This paper is about the formal specification of concurrent systems that are capable of reasoning about the consequences of their actions, enabling them to coordinate and decide on what to do autonomously. A non-deterministic procedural action programming language is defined to constrain system behaviour at design time. Rewriting logic is employed to construct and evaluate possible traces of programs in a decision-theoretic manner, allowing agents to perform goal-based actions autonomously at runtime as well as providing possibilities to model-check system properties at design time.
Fichier principal
Vignette du fichier
326181_1_En_2_Chapter.pdf (4 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01290065 , version 1 (17-03-2016)

Licence

Paternité

Identifiants

Citer

Lenz Belzner. Verifiable Decisions in Autonomous Concurrent Systems. 16th International Conference on Coordination Models and Languages (COORDINATION), Jun 2014, Berlin, Germany. pp.17-32, ⟨10.1007/978-3-662-43376-8_2⟩. ⟨hal-01290065⟩
56 Consultations
60 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More