Skip to main content

Formally Specifying Temporal Constraints and Error Recovery

Kent, Stuart and Mailbaum, T.S.E. and Quirk, W. (1993) Formally Specifying Temporal Constraints and Error Recovery. In: Proceedings of the IEEE International Symposium on Requirements Engineering. IEEE, pp. 208-215. ISBN 0-8186-3120-1. (doi:10.1109/ISRE.1993.324856) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. (Contact us about this Publication)
Official URL
http://dx.doi.org/10.1109/ISRE.1993.324856

Abstract

Recent research has advocated the use of deontic logics in requirements specification. A form of deontic action logic is described, and it is shown how it can be used to specify both temporal constraints and error recovery. The logic includes a deontic predicate of bounded obligation, and normative predicates. Bounded obligation allows bounds to be placed on the performance of actions, and can be used to specify temporal constraints. The formalism also allows the removal and extension of obligations before they must be met. The normative predicates indicate when a system has performed an action normally or abnormally, and allow the specification of corrective actions that recover from error situations

Item Type: Book section
DOI/Identification number: 10.1109/ISRE.1993.324856
Uncontrolled keywords: logic; libraries; books; educational institutions; error correction; permission; concrete
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Systems Architecture Group
Depositing User: Mark Wheadon
Date Deposited: 12 Aug 2009 16:53 UTC
Last Modified: 06 Aug 2019 13:38 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/21137 (The current URI for this page, for reference purposes)
  • Depositors only (login required):