Monitoring of Real-Time Properties

Bauer, Andreas; Leucker, Martin; Schallhart, Christian

doi:10.1007/11944836_25

Cited by 137 publications

(170 citation statements)

References 14 publications

Supporting

Mentioning

169

Contrasting

Unclassified

Order By: Relevance

“…The process then continues with assigning each requirement to an individual system agent. Goals in KAOS can be formalized in real-time linear temporal logic (LTL) [2] and used to check a requirements specification for consistency, completeness and pertinence. Although KAOS is a well-established methodology in requirements engineering with strong focus on formal specification and reasoning, its application in the design of ACEs is not straightforward.…”

Section: The Need For a Tailored Design Methods For Acesmentioning

confidence: 99%

See 1 more Smart Citation

The Invariant Refinement Method

Bureš

Gerostathopoulos

Hnětynka

et al. 2015

Software Engineering for Collective Autonomic Systems

View full text Add to dashboard Cite

Abstract. The chapter describes IRM, a method that guides the design of smart-cyber physical systems that are built according to the autonomic service-component paradigm. IRM is a requirements-oriented design method that focuses on distributed collaboration. It relies on the invariant concept to model both high-level system goals and low-level software obligations. In IRM, high-level invariants are iteratively decomposed into more specific sub-invariants up to the level that they can be operationalized by autonomous components and component collaborations (ensembles). We present the main concepts behind the method, as well the main decomposition patterns that back up the design process, and illustrate them in the ASCENS e-mobility case study.

show abstract

Section: The Need For a Tailored Design Methods For Acesmentioning

confidence: 99%

“…For example, real-time LTL [2] can be used too. Nevertheless, we use the proposed formalization as our primary goal is not model checking but rather a description of invariant refinement.…”

Section: Formalizationmentioning

confidence: 99%

The Invariant Refinement Method

Bureš

Gerostathopoulos

Hnětynka

et al. 2015

Software Engineering for Collective Autonomic Systems

View full text Add to dashboard Cite

show abstract

“…[12] proposes an approach for automata-based run-time verification, where the standard algorithm to convert (Future Time) LTL formulae to Büchi automata is modified to generate finite-state automata that check finite program traces. [13] uses non-deterministic Büchi automata to verify formulae written in TLTL, the timed version of LTL: in this case, the size of the automaton is exponential in the length of the corresponding formula as well as its largest constant.…”

Section: Related Workmentioning

confidence: 99%

Keep It Small, Keep It Real: Efficient Run-Time Verification of Web Service Compositions

Baresi

Bianculli

Guinea

et al. 2009

Formal Techniques for Distributed Systems

View full text Add to dashboard Cite

Abstract. Service compositions leverage remote services to deliver added-value distributed applications. Since services are administered and run by independent parties, the governance of service compositions is intrinsically decentralized and services may evolve independently over time. In this context, pre-deployment verification can only provide limited guarantees, while continuous run-time verification is needed to probe and guarantee the correctness of compositions at run time.This paper addresses the issue of efficiency in the run-time verification of service compositions described in BPEL. It considers an existing monitoring approach based on ALBERT, which is a temporal logic language suitable for asserting both functional and non-functional properties, and shows how to obtain the efficient run-time verification of ALBERT formulae. The paper introduces an operational semantics for ALBERT through an extension of alternating automata, and explains how to optimize it to produce smarter, and thus more efficient, encodings of defined formulae. The optimized operational semantics can then be the basis for an efficient implementation of the run-time verification framework.

show abstract

“…However, typically these logics and corresponding verification algorithms are considered on infinite executions. To follow the ideas of impartiality and anticipation, we defined in [3] a three-valued semantics for LTL obtaining the logic LTL 3 . Moreover, in [3,4], we presented a monitor synthesis algorithm for LTL 3 .…”

Section: Introductionmentioning

confidence: 99%

Impartial Anticipation in Runtime-Verification

Dong

Leucker²,

Schallhart

2008

Automated Technology for Verification and Analysis

Self Cite

View full text Add to dashboard Cite

Abstract. In this paper, a uniform approach for synthesizing monitors checking correctness properties specified in linear-time logics at runtime is provided. Therefore, a generic three-valued semantics is introduced reflecting the idea that prefixes of infinite computations are checked. Then a conceptual framework to synthesize monitors from a logical specification to check an execution incrementally is established, with special focus on resorting to the automata-theoretic approach. The merits of the presented framework are shown by providing monitor synthesis approaches for a variety of different logics such as LTL, the linear-time µ-calculus, PLTL mod , S1S, and RLTL.

show abstract

Monitoring of Real-Time Properties

Cited by 137 publications

References 14 publications

The Invariant Refinement Method

The Invariant Refinement Method

Keep It Small, Keep It Real: Efficient Run-Time Verification of Web Service Compositions

Impartial Anticipation in Runtime-Verification

Contact Info

Product

Resources

About