A Refinement Theory that Supports Reasoning about Knowledge and Time for Synchronous Agents (2001)
| Venue: | In Proc. Int. Conf. on Logic for Programming, Artificial Intelligence, and Reasoning |
| Citations: | 6 - 1 self |
BibTeX
@INPROCEEDINGS{Engelhardt01arefinement,
author = {Kai Engelhardt and Ron van der Meyden and Yoram Moses},
title = {A Refinement Theory that Supports Reasoning about Knowledge and Time for Synchronous Agents},
booktitle = {In Proc. Int. Conf. on Logic for Programming, Artificial Intelligence, and Reasoning},
year = {2001},
pages = {125--141},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
An expressive semantic framework for program refinement that supports both temporal reasoning and reasoning about the knowledge of multiple agents is developed. The refinement calculus owes the cleanliness of its decomposition rules for all programming language constructs and the relative simplicity of its semantic model to a rigid synchrony assumption which requires all agents and the environment to proceed in lockstep. The new features of the calculus are illustrated in a derivation of the two-phase-commit protocol.
Citations
| 236 | Program development by stepwise refinement - Wirth - 1971 |
| 22 | A Real-Time Refinement Calculus that Changes only Time - Utting, M, et al. - 1996 |
| 11 | Knowledge-oriented programming - Moses, Kislev - 1993 |
| 1 | On refinement and temporal annotations - Meyden, Moses - 2000 |
| 1 | A T E Xed on October 10, 2001 18 A Valid Refinement Rules from [25] and [7] Specification elimination, provided X = 2C: e S X ,!C [f; y] X ff ! yg C [f] X Advance Box: Pf0 fg C S i f0 fg C P Regress diamond: P S X ,!C [true; true] X f1 fg C[C 0 P S i - unknown authors |
