Skip navigation
Skip navigation

Verified synthesis of knowledge-based programs in finite synchronous environments

Gammie, Peter


Knowledge-based programs (KBPs) are a formalism for directly relating agents' knowledge and behaviour. Here we present a general scheme for compiling KBPs to executable automata with a proof of correctness in Isabelle/HOL. We develop the algorithm top-down, using Isabelle's locale mechanism to structure these proofs, and show that two classic examples can be synthesised using Isabelle's code generator.

CollectionsANU Research Publications
Date published: 2011
Type: Conference paper
Source: Mechanised Computability Theory
DOI: 10.1007/978-3-642-22863-6_9


File Description SizeFormat Image
01_Gammie_Verified_synthesis_of_2011.pdf262 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator