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 条
  • [21] THE LINEAR TIME - BRANCHING TIME SPECTRUM
    VANGLABBEEK, RJ
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 458 : 278 - 297
  • [22] Prediction in branching time logic
    Bonanno, G
    MATHEMATICAL LOGIC QUARTERLY, 2001, 47 (02) : 239 - 247
  • [23] Transition Semantics for Branching Time
    Rumberg, Antje
    JOURNAL OF LOGIC LANGUAGE AND INFORMATION, 2016, 25 (01) : 77 - 108
  • [24] The Interpretation of Branching Time Diagrams
    Jakobsen, David
    Ohrstrom, Peter
    GRAPH-BASED REPRESENTATION AND REASONING (ICCS 2016), 2016, 9717 : 31 - 39
  • [25] THE TEMPORAL LOGIC OF BRANCHING TIME
    BENARI, M
    PNUELI, A
    MANNA, Z
    ACTA INFORMATICA, 1983, 20 (03) : 207 - 226
  • [26] Probabilistic Causation in Branching Time
    Mika Oksanen
    Synthese, 2002, 132 : 89 - 117
  • [27] Safety and liveness in branching time
    Manolios, P
    Trefler, R
    16TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2001, : 366 - 374
  • [28] BRANCHING SPACE-TIME
    BELNAP, N
    SYNTHESE, 1992, 92 (03) : 385 - 434
  • [29] BRANCHING TIME AND INDETERMINACY Introduction
    Malpass, Alex
    Gifford, Chris
    SYNTHESE, 2012, 188 (01) : 1 - 3
  • [30] BRANCHING TIME TEMPORAL LOGIC
    EMERSON, EA
    SRINIVASAN, J
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 354 : 123 - 172