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 条
  • [31] Abstraction for branching time properties
    Namjoshi, KS
    COMPUTER AIDED VERIFICATION, 2003, 2725 : 288 - 300
  • [32] A Branching Time Variant of CaRet
    Gutsfeld, Jens Oliver
    Mueller-Olm, Markus
    Nordhoff, Benedikt
    MODEL CHECKING SOFTWARE, SPIN 2018, 2018, 10869 : 153 - 170
  • [33] SAFETY FOR BRANCHING TIME SEMANTICS
    BOUAJJANI, A
    FERNANDEZ, JC
    GRAF, S
    RODRIGUEZ, C
    SIFAKIS, J
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 510 : 76 - 92
  • [34] Linear time datalog and branching time logic
    Gottlob, G
    Grädel, E
    Veith, H
    LOGIC-BASED ARTIFICIAL INTELLIGENCE, 2000, 597 : 443 - 467
  • [35] LEGISLATIVE SPECIFICATIONS FOR COORDINATING WITH UNIVERSAL TIME
    Seago, John H.
    Seidelmann, P. Kenneth
    Allen, Steve
    DECOUPLING CIVIL TIMEKEEPING FROM EARTH ROTATION, 2011, 113 : 29 - +
  • [36] Transition Semantics for Branching Time
    Antje Rumberg
    Journal of Logic, Language and Information, 2016, 25 : 77 - 108
  • [37] Consistency as a Branching Time Notion
    Kiehn, Astrid
    Pattathurajan, Mohnish
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2019, 2019, 11436 : 359 - 377
  • [38] Probabilistic causation in branching time
    Oksanen, M
    SYNTHESE, 2002, 132 (1-2) : 89 - 117
  • [39] TIME DOMAIN SPECIFICATIONS OF DIGITAL CONTROLLERS
    NEUMANN, LP
    SMITH, CL
    MURRILL, PW
    INSTRUMENTS & CONTROL SYSTEMS, 1969, 42 (05): : 97 - &
  • [40] Refactoring Real-time Specifications
    Smith, Graeme
    McComb, Tim
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2008, 214 (0C) : 359 - 380