About: Selective Monitoring

Not logged in : Login

(Sponging disallowed)

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Selective Monitoring Goto Sponge NotDistinct Permalink

An Entity of Type : bibo:AcademicArticle, within Data Space : linkeddata.uriburner.com:28898 associated with source document(s)

Attributes	Values
type	http://eprints.org/ontology/ConferenceItemEPrint http://eprints.org/ontology/EPrint Article Academic Article
seeAlso	HTML Summary of #67553 Selective Monitoring
sameAs	Selective Monitoring
http://eprints.org/ontology/hasDocument	Selective Monitoring (PDF) Selective Monitoring (Other) Selective Monitoring (Other) Selective Monitoring (Other) Selective Monitoring (Other) Selective Monitoring (Other)
http://eprints.org/ontology/hasPublished	Selective Monitoring (PDF)
dc:hasVersion	Selective Monitoring (PDF)
Title	Selective Monitoring
described by	https://demo.openlinksw.com/about/id/entity/https/raw.githubusercontent.com/annajordanous/CO644Files/main/export_kar_RDFN3.n3
Date	2018-09-30
Creator	Stefan Kiefer Radu Grigore
status	peer reviewed published
Publisher	LIPICS
abstract	We study selective monitors for labelled Markov chains. Monitors observe the outputs that are generated by a Markov chain during its run, with the goal of identifying runs as correct or faulty. A monitor is selective if it skips observations in order to reduce monitoring overhead. We are interested in monitors that minimize the expected number of observations. We establish an undecidability result for selectively monitoring general Markov chains. On the other hand, we show for non-hidden Markov chains (where any output identifies the state the Markov chain is in) that simple optimal monitors exist and can be computed efficiently, based on DFA language equivalence. These monitors do not depend on the precise transition probabilities in the Markov chain. We report on experiments where we compute these monitors for several open-source Java projects.
Is Part Of	Leibniz International Proceedings in Informatics https://kar.kent.ac.uk/id/repository
list of authors	https://kar.kent.ac.uk/id/eprint/67553#authors
presented at	29th International Conference on Concurrency Theory (CONCUR 2018), 4--7 September 2018, Beijing, China
volume	20
is topic of	https://raw.githubusercontent.com/annajordanous/CO644Files/main/export_kar_RDFN3.n3
is primary topic of	HTML Summary of #67553 Selective Monitoring

Faceted Search & Find service v1.17_git149 as of Dec 03 2024

Alternative Linked Data Documents: iSPARQL | ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3332 as of Jan 29 2025, on Linux (x86_64-generic-linux-glibc25), Single-Server Edition (378 GB total memory, 22 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software