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 条
  • [41] REAL-TIME PROGRAMMING SPECIFICATIONS
    HEAD, RV
    COMMUNICATIONS OF THE ACM, 1963, 6 (07) : 376 - 383
  • [42] Mining Time for Timed Regular Specifications
    Narayan, Apurva
    Fischmeister, Sebastian
    2019 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC), 2019, : 63 - 69
  • [43] Branching Time as a Conceptual Structure
    Ohrstrom, Peter
    Scharfe, Henrik
    Ploug, Thomas
    CONCEPTUAL STRUCTURES: FROM INFORMATION TO INTELLIGENCE, 2010, 6208 : 125 - 138
  • [44] Decomposing real-time specifications
    Olderog, ER
    Dierks, H
    COMPOSITIONALITY: THE SIGNIFICANT DIFFERENCE, 1998, 1536 : 465 - 489
  • [45] RELATION BETWEEN ONE-TIME-ONLY BRANCHING PROGRAMS AND REAL-TIME BRANCHING PROGRAMS
    BEBJAK, A
    STEFANEKOVA, I
    COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1988, 7 (02): : 107 - 111
  • [46] LINEAR TIME AND BRANCHING TIME SEMANTICS FOR RECURSION WITH MERGE
    DEBAKKER, JW
    BERGSTRA, JA
    KLOP, JW
    MEYER, JJC
    THEORETICAL COMPUTER SCIENCE, 1984, 34 (1-2) : 135 - 156
  • [47] The quantitative linear-time-branching-time spectrum
    Fahrenberg, Uli
    Legay, Axel
    THEORETICAL COMPUTER SCIENCE, 2014, 538 : 54 - 69
  • [48] The Quantitative Linear-Time-Branching-Time Spectrum
    Fahrenberg, Uli
    Legay, Axel
    Thrane, Claus
    IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2011), 2011, 13 : 103 - 114
  • [49] LINEAR TIME AND BRANCHING TIME SEMANTICS FOR RECURSION WITH MERGE
    DEBAKKER, JW
    BERGSTRA, JA
    KLOP, JW
    MEYER, JJC
    LECTURE NOTES IN COMPUTER SCIENCE, 1983, 154 : 39 - 51
  • [50] Branching time and orthogonal bisimulation equivalence
    Bergstra, JA
    Ponsea, A
    van der Zwaag, MB
    THEORETICAL COMPUTER SCIENCE, 2003, 309 (1-3) : 313 - 355