Formal Aspects of Computing

, Volume 26, Issue 3, pp 563–589

Reasoning about goal-directed real-time teleo-reactive programs

  • Brijesh Dongol
  • Ian J. Hayes
  • Peter J. Robinson
Original Article

DOI: 10.1007/s00165-012-0272-1

Cite this article as:
Dongol, B., Hayes, I.J. & Robinson, P.J. Form Asp Comp (2014) 26: 563. doi:10.1007/s00165-012-0272-1

Abstract

The teleo-reactive programming model is a high-level approach to developing real-time systems that supports hierarchical composition and durative actions. The model is different from frameworks such as action systems, timed automata and TLA+, and allows programs to be more compact and descriptive of their intended behaviour. Teleo-reactive programs are particularly useful for implementing controllers for autonomous agents that must react robustly to their dynamically changing environments. In this paper, we develop a real-time logic that is based on Duration Calculus and use this logic to formalise the semantics of teleo-reactive programs. We develop rely/guarantee rules that facilitate reasoning about a program and its environment in a compositional manner. We present several theorems for simplifying proofs of teleo-reactive programs and present a partially mechanised method for proving progress properties of goal-directed agents.

Keywords

Teleo-reactive programming Goal-directed agents Rely/guarantee reasoning Real-time programs Reactive systems Interval-based logics 

Copyright information

© British Computer Society 2013

Authors and Affiliations

  • Brijesh Dongol
    • 1
    • 2
  • Ian J. Hayes
    • 2
  • Peter J. Robinson
    • 2
  1. 1.Department of Computer ScienceThe University of SheffieldSheffieldUK
  2. 2.School of Information Technology and Electrical EngineeringThe University of QueenslandBrisbaneAustralia

Personalised recommendations