About: Realizing [Formula: see text]-regular Hyperproperties

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Realizing [Formula: see text]-regular Hyperproperties Goto Sponge NotDistinct Permalink

An Entity of Type : schema:ScholarlyArticle, within Data Space : covidontheweb.inria.fr associated with source document(s)

Attributes	Values
type	Academic Article research paper schema:ScholarlyArticle
isDefinedBy	Covid-on-the-Web dataset
has title	Realizing [Formula: see text]-regular Hyperproperties
Creator	Hahn, Christopher Finkbeiner, Bernd Hofmann, Jana Tentrup, Leander
Source	PMC
abstract	We study the expressiveness and reactive synthesis problem of HyperQPTL, a logic that specifies [Formula: see text]-regular hyperproperties. HyperQPTL is an extension of linear-time temporal logic (LTL) with explicit trace and propositional quantification and therefore truly combines trace relations and [Formula: see text]-regularity. As such, HyperQPTL can express promptness, which states that there is a common bound on the number of steps up to which an event must have happened. We demonstrate how the HyperQPTL formulation of promptness differs from the type of promptness expressible in the logic Prompt-LTL. Furthermore, we study the realizability problem of HyperQPTL by identifying decidable fragments, where one decidable fragment contains formulas for promptness. We show that, in contrast to the satisfiability problem of HyperQPTL, propositional quantification has an immediate impact on the decidability of the realizability problem. We present a reduction to the realizability problem of HyperLTL, which immediately yields a bounded synthesis procedure. We implemented the synthesis procedure for HyperQPTL in the bounded synthesis tool BoSy. Our experimental results show that a range of arbiter satisfying promptness can be synthesized.
has issue date	2020-06-16(xsd:dateTime)
bibo:doi	10.1007/978-3-030-53291-8_4
has license	cc-by
sha1sum (hex)	a4855c3296fb54a405f7f3a6c7cacee8a67de228
schema:url	https://doi.org/10.1007/978-3-030-53291-8_4
resource representing a document's title	Realizing [Formula: see text]-regular Hyperproperties
has PubMed Central identifier	PMC7363225
schema:publication	Computer Aided Verification
resource representing a document's body	covid:a4855c3296fb54a405f7f3a6c7cacee8a67de228#body_text
is schema:about of	named entity 'LOGIC' named entity 'IMMEDIATE' named entity 'PROMPT' named entity 'EXPERIMENTAL RESULTS' named entity 'IS A' named entity 'REGULARITY' named entity 'UP TO' named entity 'SYNTHESIS' covid:arg/a4855c3296fb54a405f7f3a6c7cacee8a67de228 named entity 'realizability' named entity 'LTL' named entity 'satisfiability problem' named entity 'realizability' named entity 'realizability' named entity 'logic' named entity 'quantifier' named entity 'finite set' named entity 'ith' named entity 'LTL' named entity 'atomic propositions' named entity 'undecidable' named entity 'undecidable' named entity 'quantifier' named entity 'existentially quantified' named entity 'decidable' named entity 'undecidable' named entity 'decidable' named entity 'NSA' named entity 'iff' named entity 'realizability' named entity 'NSA' named entity 'realizability' named entity 'logic' named entity 'decidable' named entity 'PCP' named entity 'halting state' named entity 'decidable' named entity 'logic' named entity 'quantifier' named entity 'model checking problem' named entity 'realizability' named entity '2CM' named entity 'decidable' named entity 'realizability' named entity 'dining cryptographers problem' named entity 'PCP' named entity 'logic' named entity 'LTL' named entity '2CM' named entity '2CM' named entity 'atomic propositions' named entity 'existentially quantified' named entity 'undecidable' named entity 'tuple' named entity 'Kripke structure' named entity 'experimental results' named entity 'NSA' named entity 'Epistemic' named entity 'realizability' named entity 'syntactic' named entity 'logic' named entity 'universal quantification' named entity 'realizability' named entity 'LTL' named entity 'algorithm' named entity 'counter machine' named entity 'realizability' named entity 'infinite sequence' named entity 'Formula 1' named entity 'atomic propositions' named entity 'n-tuples' named entity 'atomic propositions' named entity 'syntax' named entity 'logic' named entity 'semantic' named entity 'quantifier' named entity 'decidable' named entity 'syntactic sugar' named entity 'decidable' named entity 'quantifiers'

Faceted Search & Find service v1.13.91 as of Mar 24 2020

Alternative Linked Data Documents: Sponger | ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3229 as of Jul 10 2020, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (94 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software