Notions of Conformance Testing for Cyber-Physical Systems: Overview and Roadmap (Invited Paper)

Khakpour, Narges; Mousavi, Mohammad Reza

doi:10.4230/lipics.concur.2015.18

Cited by 3 publications

(3 citation statements)

References 59 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, a number of notions of conformance for cyberphysical systems have been proposed [ARM17,KM15]. It turns out that these notions, two of which are quoted below, can provide a rigorous basis for doping detection.…”

Section: Conformance Relationsmentioning

confidence: 99%

“…These theories were subsequently adopted in order to detect doping, or formally, to check system cleanness [HBDK18,BDH19] (corresponding to the absence of doping). In the present paper, we extend the theory of doping to the setting of cyber-physical systems (CPS) by exploiting the notions of conformance testing for CPS [AMF14,DMP17,KM15]. The existing theories of software doping define doping in terms of drastic deviations in output as a result of minor deviations in input, where the term "deviation" refers to differences in validity of propositions or values of variables.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Conformance Relations and Hyperproperties for Doping Detection in Time and Space

Biewer¹,

Dimitrova²,

Fries³

et al. 2022

Logical Methods in Computer Science

Self Cite

View full text Add to dashboard Cite

We present a novel and generalised notion of doping cleanness for cyber-physical systems that allows for perturbing the inputs and observing the perturbed outputs both in the time- and value-domains. We instantiate our definition using existing notions of conformance for cyber-physical systems. As a formal basis for monitoring conformance-based cleanness, we develop the temporal logic HyperSTL*, an extension of Signal Temporal Logics with trace quantifiers and a freeze operator. We show that our generalised definitions are essential in a data-driven method for doping detection and apply our definitions to a case study concerning diesel emission tests.

show abstract

Section: Conformance Relationsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Conformance Relations and Hyperproperties for Doping Detection in Time and Space

Biewer¹,

Dimitrova²,

Fries³

et al. 2022

Logical Methods in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…[Gav18]). Applications have also been proposed in differential privacy [CGPX14] and conformance testing of hybrid systems [KM15]. Like their two-valued counterparts, behavioural distances have been introduced for quite a range of system types, such as various forms of probabilistic labelled transition systems or labelled Markov processes [GJS90,vBW05,Des99,DGJP04]; systems combining nondeterministic and probabilistic branching variously known as nondeterministic probabilistic transition systems [CGT16], probabilistic automata [DCPP06], and Markov decision processes [FPP04]; weighted automata [BGP17]; fuzzy transition systems [CSWC13] and fuzzy Kripke models [Fan15]; and various forms of metric transition systems [dAFS09,FLT11,FL14], which are nondeterministic transition systems with additional quantitative information, e.g.…”

Section: Introductionmentioning

confidence: 99%

Characteristic Logics for Behavioural Hemimetrics via Fuzzy Lax Extensions

Wild¹,

Schröder²

2022

Logical Methods in Computer Science

View full text Add to dashboard Cite

In systems involving quantitative data, such as probabilistic, fuzzy, or metric systems, behavioural distances provide a more fine-grained comparison of states than two-valued notions of behavioural equivalence or behaviour inclusion. Like in the two-valued case, the wide variation found in system types creates a need for generic methods that apply to many system types at once. Approaches of this kind are emerging within the paradigm of universal coalgebra, based either on lifting pseudometrics along set functors or on lifting general real-valued (fuzzy) relations along functors by means of fuzzy lax extensions. An immediate benefit of the latter is that they allow bounding behavioural distance by means of fuzzy (bi-)simulations that need not themselves be hemi- or pseudometrics; this is analogous to classical simulations and bisimulations, which need not be preorders or equivalence relations, respectively. The known generic pseudometric liftings, specifically the generic Kantorovich and Wasserstein liftings, both can be extended to yield fuzzy lax extensions, using the fact that both are effectively given by a choice of quantitative modalities. Our central result then shows that in fact all fuzzy lax extensions are Kantorovich extensions for a suitable set of quantitative modalities, the so-called Moss modalities. For nonexpansive fuzzy lax extensions, this allows for the extraction of quantitative modal logics that characterize behavioural distance, i.e. satisfy a quantitative version of the Hennessy-Milner theorem; equivalently, we obtain expressiveness of a quantitative version of Moss' coalgebraic logic. All our results explicitly hold also for asymmetric distances (hemimetrics), i.e. notions of quantitative simulation.

show abstract

Probabilistic Conformance for Cyber-Physical Systems

Wang

Zarei

Bonakdarpoor

et al. 2020

Preprint

View full text Add to dashboard Cite

Conformance is a key concept in the analysis of cyber-physical systems (CPS). It indicates that two models simultaneously satisfy the same specifications of interest practically so that the result of analyzing one model automatically transfers to the other. In this paper, we propose a new concept of probabilistic conformance for CPS, extending previous study to the probabilistic domain. It is defined by the approximately equal satisfaction probabilities for a given parameterized signal temporal logic specification. Then we propose the first statistical verification method for probabilistic conformance of temporal logic specifications for grey-box CPS. To this end, we introduce a novel extended Kolmogorov-Smirnov test that can check approximately equal of two probability distributions for any desired confidence level (< 1). We apply our technique to verify the probabilistic conformance of: (1) the startup time of the widely-used full and simplified models of the Toyota Powertrain system, (2) the settling time of lane-keeping controllers based on model predictive control and neural network (NN)-based lanekeeping controllers of different sizes for an autonomous car, and (3) the maximal deviation of DC voltage between the full and simplified models of a power grid system.

show abstract

Notions of Conformance Testing for Cyber-Physical Systems: Overview and Roadmap (Invited Paper)

Cited by 3 publications

References 59 publications

Conformance Relations and Hyperproperties for Doping Detection in Time and Space

Conformance Relations and Hyperproperties for Doping Detection in Time and Space

Characteristic Logics for Behavioural Hemimetrics via Fuzzy Lax Extensions

Probabilistic Conformance for Cyber-Physical Systems

Contact Info

Product

Resources

About