An Algebraic Framework for Runtime Verification

An Algebraic Framework for Runtime Verification

Runtime verification (RV) is a pragmatic and scalable, yet rigorous technique, to assess the correctness of complex systems, including cyber-physical systems (CPS). By measuring how robustly a CPS run satisfies a specification, RV allows in addition, to quantify the resiliency of a CPS to perturbati...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Jaksic, Stefan, Bartocci, Ezio, Grosu, Radu, Nickovic, Dejan
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Logic in Computer Science
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Jaksic, Stefan
Bartocci, Ezio
Grosu, Radu
Nickovic, Dejan
description Runtime verification (RV) is a pragmatic and scalable, yet rigorous technique, to assess the correctness of complex systems, including cyber-physical systems (CPS). By measuring how robustly a CPS run satisfies a specification, RV allows in addition, to quantify the resiliency of a CPS to perturbations. In this paper we propose Algebraic Runtime Verification (ARV), a general, semantic framework for RV, which takes advantage of the monoidal structure of runs (w.r.t. concatenation) and the semiring structure of a specification automaton (w.r.t. choice and concatenation), to compute in an incremental and application specific fashion the resiliency measure. This allows us to expose the core aspects of RV, by developing an abstract monitoring algorithm, and to strengthen and unify the various qualitative and quantitative approaches to RV, by instantiating choice and concatenation with real-valued functions as dictated by the application. We demonstrate the power and effectiveness of our framework on two case studies from the automotive domain.
doi_str_mv 10.48550/arxiv.1802.03775
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1802_03775</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1802_03775</sourcerecordid><originalsourceid>FETCH-LOGICAL-a675-fdf1bf35aaa56adb018adac555dd4ad2e52917532d8cd1098a52c00101d2ead83</originalsourceid><addsrcrecordid>eNotzstqwzAQhWFtuihpH6Cr6gXsjKRMrCyNSZpAoBBMt2askYqoL0XN9e2Tpl2dxQ-HT4gXBfnMIsKU0jkec2VB52CKAh_FtBxk2X36NlF0cpWo96cxfckwJrk7DPvYe_nhUwzR0T6Ow5N4CNT9-Of_nYh6tayrdbZ9f9tU5TajeYFZ4KDaYJCIcE7cgrLE5BCReUasPeqFKtBoto4VLCyhdgAK1K0RWzMRr3-3d3HznWJP6dL8ypu73FwBBEI-Bw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>An Algebraic Framework for Runtime Verification</title><source>arXiv.org</source><creator>Jaksic, Stefan ; Bartocci, Ezio ; Grosu, Radu ; Nickovic, Dejan</creator><creatorcontrib>Jaksic, Stefan ; Bartocci, Ezio ; Grosu, Radu ; Nickovic, Dejan</creatorcontrib><description>Runtime verification (RV) is a pragmatic and scalable, yet rigorous technique, to assess the correctness of complex systems, including cyber-physical systems (CPS). By measuring how robustly a CPS run satisfies a specification, RV allows in addition, to quantify the resiliency of a CPS to perturbations. In this paper we propose Algebraic Runtime Verification (ARV), a general, semantic framework for RV, which takes advantage of the monoidal structure of runs (w.r.t. concatenation) and the semiring structure of a specification automaton (w.r.t. choice and concatenation), to compute in an incremental and application specific fashion the resiliency measure. This allows us to expose the core aspects of RV, by developing an abstract monitoring algorithm, and to strengthen and unify the various qualitative and quantitative approaches to RV, by instantiating choice and concatenation with real-valued functions as dictated by the application. We demonstrate the power and effectiveness of our framework on two case studies from the automotive domain.</description><identifier>DOI: 10.48550/arxiv.1802.03775</identifier><language>eng</language><subject>Computer Science - Logic in Computer Science</subject><creationdate>2018-02</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,782,887</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1802.03775$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1802.03775$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Jaksic, Stefan</creatorcontrib><creatorcontrib>Bartocci, Ezio</creatorcontrib><creatorcontrib>Grosu, Radu</creatorcontrib><creatorcontrib>Nickovic, Dejan</creatorcontrib><title>An Algebraic Framework for Runtime Verification</title><description>Runtime verification (RV) is a pragmatic and scalable, yet rigorous technique, to assess the correctness of complex systems, including cyber-physical systems (CPS). By measuring how robustly a CPS run satisfies a specification, RV allows in addition, to quantify the resiliency of a CPS to perturbations. In this paper we propose Algebraic Runtime Verification (ARV), a general, semantic framework for RV, which takes advantage of the monoidal structure of runs (w.r.t. concatenation) and the semiring structure of a specification automaton (w.r.t. choice and concatenation), to compute in an incremental and application specific fashion the resiliency measure. This allows us to expose the core aspects of RV, by developing an abstract monitoring algorithm, and to strengthen and unify the various qualitative and quantitative approaches to RV, by instantiating choice and concatenation with real-valued functions as dictated by the application. We demonstrate the power and effectiveness of our framework on two case studies from the automotive domain.</description><subject>Computer Science - Logic in Computer Science</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzstqwzAQhWFtuihpH6Cr6gXsjKRMrCyNSZpAoBBMt2askYqoL0XN9e2Tpl2dxQ-HT4gXBfnMIsKU0jkec2VB52CKAh_FtBxk2X36NlF0cpWo96cxfckwJrk7DPvYe_nhUwzR0T6Ow5N4CNT9-Of_nYh6tayrdbZ9f9tU5TajeYFZ4KDaYJCIcE7cgrLE5BCReUasPeqFKtBoto4VLCyhdgAK1K0RWzMRr3-3d3HznWJP6dL8ypu73FwBBEI-Bw</recordid><startdate>20180211</startdate><enddate>20180211</enddate><creator>Jaksic, Stefan</creator><creator>Bartocci, Ezio</creator><creator>Grosu, Radu</creator><creator>Nickovic, Dejan</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20180211</creationdate><title>An Algebraic Framework for Runtime Verification</title><author>Jaksic, Stefan ; Bartocci, Ezio ; Grosu, Radu ; Nickovic, Dejan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a675-fdf1bf35aaa56adb018adac555dd4ad2e52917532d8cd1098a52c00101d2ead83</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Computer Science - Logic in Computer Science</topic><toplevel>online_resources</toplevel><creatorcontrib>Jaksic, Stefan</creatorcontrib><creatorcontrib>Bartocci, Ezio</creatorcontrib><creatorcontrib>Grosu, Radu</creatorcontrib><creatorcontrib>Nickovic, Dejan</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Jaksic, Stefan</au><au>Bartocci, Ezio</au><au>Grosu, Radu</au><au>Nickovic, Dejan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An Algebraic Framework for Runtime Verification</atitle><date>2018-02-11</date><risdate>2018</risdate><abstract>Runtime verification (RV) is a pragmatic and scalable, yet rigorous technique, to assess the correctness of complex systems, including cyber-physical systems (CPS). By measuring how robustly a CPS run satisfies a specification, RV allows in addition, to quantify the resiliency of a CPS to perturbations. In this paper we propose Algebraic Runtime Verification (ARV), a general, semantic framework for RV, which takes advantage of the monoidal structure of runs (w.r.t. concatenation) and the semiring structure of a specification automaton (w.r.t. choice and concatenation), to compute in an incremental and application specific fashion the resiliency measure. This allows us to expose the core aspects of RV, by developing an abstract monitoring algorithm, and to strengthen and unify the various qualitative and quantitative approaches to RV, by instantiating choice and concatenation with real-valued functions as dictated by the application. We demonstrate the power and effectiveness of our framework on two case studies from the automotive domain.</abstract><doi>10.48550/arxiv.1802.03775</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1802.03775
ispartof
issn
language eng
recordid cdi_arxiv_primary_1802_03775
source arXiv.org
subjects Computer Science - Logic in Computer Science
title An Algebraic Framework for Runtime Verification
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-05T04%3A08%3A00IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20Algebraic%20Framework%20for%20Runtime%20Verification&rft.au=Jaksic,%20Stefan&rft.date=2018-02-11&rft_id=info:doi/10.48550/arxiv.1802.03775&rft_dat=%3Carxiv_GOX%3E1802_03775%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true