Skip to Main content Skip to Navigation
Conference papers

Verifiable Decisions in Autonomous Concurrent Systems

Abstract : 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.
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/hal-01290065
Contributor : Hal Ifip <>
Submitted on : Thursday, March 17, 2016 - 3:24:09 PM
Last modification on : Thursday, May 12, 2016 - 10:48:00 AM
Long-term archiving on: : Saturday, June 18, 2016 - 5:54:35 PM

File

326181_1_En_2_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

120

Files downloads

170