Encapsulating deontic and branching time specifications

被引:0
|
作者
Castro, Pablo F. [1 ,2 ]
Maibaum, Thomas S. E. [3 ]
机构
[1] Univ Nacl Rio Cuarto, FCEFQyN, Dept Comp, Cordoba, Argentina
[2] Consejo Nacl Invest Cient & Tecn, Cordoba, Argentina
[3] McMaster Univ, Dept Comp & Software, Hamilton, ON, Canada
关键词
Software specification; Formal methods; Software engineering; Bisimulation; Category theory; FAULT-TOLERANCE; BISIMULATION; MODULES; SYSTEMS;
D O I
10.1016/j.tcs.2011.12.016
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper, we investigate formal mechanisms to enable designers to decompose specifications (stated in a given logic) into several interacting components in such a way that the composition of these components preserves their encapsulation and internal non-determinism. The preservation of encapsulation (or locality) enables a modular form of reasoning over specifications, while the conservation of the internal non-determinism is important to guarantee that the branching time properties of components are not lost when the entire system is obtained. The basic ideas come from the work of Fiadeiro and Maibaum where notions from category theory are used to structure logical specifications. As the work of Fiadeiro and Maibaum is stated in a linear temporal logic, here we investigate how to extend these notions to a branching time logic, which can be used to reason about systems where non-determinism is present. To illustrate the practical applications of these ideas, we introduce deontic operators in our logic and we show that the modularization of specifications also allows designers to maintain the encapsulation of deontic prescriptions: this is in particular useful to reason about fault-tolerant systems, as we demonstrate with a small example. (c) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:98 / 122
页数:25
相关论文
共 50 条
  • [1] A functional program for agents, actions, and deontic specifications
    Wyner, Adam Zachary
    DECLARATIVE AGENT LANGUAGES AND TECHNOLOGIES IV, 2006, 4237 : 239 - 256
  • [2] State/event software verification for branching-time specifications
    Chaki, S
    Clarke, E
    Grumberg, O
    Ouaknine, J
    Sharygina, N
    Touili, T
    Veith, H
    INTEGRATED FORMAL METHODS, PROCEEDINGS, 2005, 3771 : 53 - 69
  • [3] Synthesizing Fault-Tolerant Programs from Deontic Logic Specifications
    Demasi, Ramiro
    2013 28TH IEEE/ACM INTERNATIONAL CONFERENCE ON AUTOMATED SOFTWARE ENGINEERING (ASE), 2013, : 750 - 753
  • [4] OUGHT, TIME, AND DEONTIC PARADOXES
    CASTENADA, HN
    JOURNAL OF PHILOSOPHY, 1977, 74 (12): : 775 - 791
  • [5] Cumulativity, identity and time in deontic logic
    Parent, X
    FUNDAMENTA INFORMATICAE, 2001, 48 (2-3) : 237 - 252
  • [6] Encoding time and signs exposure time in the representation of diagrammatic deontic meanings
    Vargas, Cristina
    Moreno-Rios, Sergio
    Castro, Candida
    Underwood, Geoffrey
    ACTA PSYCHOLOGICA, 2011, 137 (01) : 106 - 114
  • [7] Branching Allen -: Reasoning with intervals in branching time
    Ragni, M
    Wölfl, S
    SPATIAL COGNITION IV, REASONING, ACTION, INTERACTION, 2004, 3343 : 323 - 343
  • [8] Encapsulating peritoneal sclerosis: Time to act
    Topley, Nicholas
    PERITONEAL DIALYSIS INTERNATIONAL, 2006, 26 (05): : 564 - 565
  • [9] FUTURE BRANCHING TIME
    KESSLER, G
    THEORIA, 1975, 41 : 89 - 95
  • [10] Events in branching time
    Wölfl S.
    Studia Logica, 2005, 79 (2) : 255 - 282