Abstract Monitors for Quantitative Specifications

被引:3
|
作者
Henzinger, Thomas A. [1 ]
Mazzocchi, Nicolas [1 ]
Sarac, N. Ege [1 ]
机构
[1] Inst Sci & Technol Austria ISTA, Klosterneuburg, Austria
来源
关键词
Abstract monitor; Approximate monitoring; Quantitative monitoring; Monitor resources;
D O I
10.1007/978-3-031-17196-3_11
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Quantitative monitoring can be universal and approximate: For every finite sequence of observations, the specification provides a value and the monitor outputs a best-effort approximation of it. The quality of the approximation may depend on the resources that are available to the monitor. By taking to the limit the sequences of specification values and monitor outputs, we obtain precision-resource trade-offs also for limit monitoring. This paper provides a formal framework for studying such trade-offs using an abstract interpretation for monitors: For each natural number n, the aggregate semantics of a monitor at time n is an equivalence relation over all sequences of at most n observations so that two equivalent sequences are indistinguishable to the monitor and thus mapped to the same output. This abstract interpretation of quantitative monitors allows us to measure the number of equivalence classes (or "resource use") that is necessary for a certain precision up to a certain time, or at any time. Our framework offers several insights. For example, we identify a family of specifications for which any resource-optimal exact limit monitor is independent of any error permitted over finite traces. Moreover, we present a specification for which any resource-optimal approximate limit monitor does not minimize its resource use at any time.
引用
收藏
页码:200 / 220
页数:21
相关论文
共 50 条
  • [21] Compositionality for quantitative specifications
    Uli Fahrenberg
    Jan Křetínský
    Axel Legay
    Louis-Marie Traonouez
    Soft Computing, 2018, 22 : 1139 - 1158
  • [22] Compositionality for quantitative specifications
    Fahrenberg, Uli
    Kretinsky, Jan
    Legay, Axel
    Traonouez, Louis-Marie
    SOFT COMPUTING, 2018, 22 (04) : 1139 - 1158
  • [23] Abstract animator for temporal specifications:: Application to TLA
    Cansell, D
    Méry, D
    STATIC ANALYSIS, 1999, 1694 : 284 - 299
  • [24] Formal abstract architecture for use case specifications
    Rysavy, O
    Bures, F
    11TH IEEE INTERNATIONAL CONFERENCE AND WORKSHOP ON THE ENGINEERING OF COMPUTER-BASED SYSTEMS, PROCEEDINGS, 2004, : 203 - 210
  • [25] BEHAVIORAL CATEGORICITY OF ABSTRACT DATA TYPE SPECIFICATIONS
    LESCANNE, P
    COMPUTER JOURNAL, 1983, 26 (04): : 289 - 292
  • [26] Transition Specifications for Dynamic Abstract Data Types
    Martin Große-Rhode
    Applied Categorical Structures, 1997, 5 : 265 - 308
  • [27] Transition specifications for dynamic abstract data types
    Grosse-Rhode, Martin
    1997, Kluwer Academic Publishers, Dordrecht, Netherlands (05)
  • [28] Abstract Software Specifications and Automatic Proof of Refinement
    Dross, Claire
    Moy, Yannick
    RELIABILITY, SAFETY, AND SECURITY OF RAILWAY SYSTEMS: MODELLING, ANALYSIS, VERIFICATION, AND CERTIFICATION, RSSRAIL 2016, 2016, 9707 : 215 - 230
  • [29] A reference model for requirements and specifications - Extended abstract
    Gunter, CA
    Gunter, EL
    Jackson, M
    Zave, P
    4TH INTERNATIONAL CONFERENCE ON REQUIREMENTS ENGINEERING, PROCEEDINGS, 2000, : 189 - 189
  • [30] Transition specifications for dynamic abstract data types
    GrosseRhode, M
    APPLIED CATEGORICAL STRUCTURES, 1997, 5 (03) : 265 - 308