Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Nicolas Mazzocchi"'
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031308284
Safety and liveness are elementary concepts of computation, and the foundation of many verification paradigms. The safety-liveness classification of boolean properties characterizes whether a given property can be falsified by observing a finite pref
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eeba37dc07a484812bc137bf8527cb2a
https://doi.org/10.1007/978-3-031-30829-1_17
https://doi.org/10.1007/978-3-031-30829-1_17
Publikováno v:
Runtime Verification ISBN: 9783031171956
Quantitative monitoring can be universal and approximate: For every finite sequence of observations, the specification provides a value and the monitor outputs a best-effort approximation of it. The quality of the approximation may depend on the reso
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2d06c1aada0a11446c41430b64c47036
https://doi.org/10.1007/978-3-031-17196-3_11
https://doi.org/10.1007/978-3-031-17196-3_11
Publikováno v:
Computer Aided Verification ISBN: 9783031131875
We propose a novel algorithm to decide the language inclusion between (nondeterministic) Büchi automata, a PSpace-complete problem. Our approach, like others before, leverage a notion of quasiorder to prune the search for a counterexample by discard
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3f2a3e9832f05ae548b74cfc1e3ea787
https://doi.org/10.1007/978-3-031-13188-2_6
https://doi.org/10.1007/978-3-031-13188-2_6
Publikováno v:
Journal of computer and system sciences, 106
In this paper, we investigate the expressive power and the algorithmic properties of weighted expressions, which define functions from finite words to integers. First, we consider a slight extension of an expression formalism, introduced by Chatterje
Publikováno v:
International journal of foundations of computer science, 31 (6
We introduce a logic to express structural properties of automata with string inputs and, possibly, outputs in some monoid. In this logic, the set of predicates talking about the output values is parametric, and we provide sufficient conditions on th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::589989657ed4806b78da90b6f0ba3453
http://arxiv.org/abs/1810.03515
http://arxiv.org/abs/1810.03515
Publikováno v:
Developments in Language Theory ISBN: 9783319986531
DLT
DLT
We introduce a logic to express structural properties of automata with string inputs and, possibly, outputs in some monoid. In this logic, the set of predicates talking about the output values is parametric, and we provide sufficient conditions on th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::793e437ca7f57b44ae6f31473d339146
https://doi.org/10.1007/978-3-319-98654-8_25
https://doi.org/10.1007/978-3-319-98654-8_25
Publikováno v:
Fundamentals of Computation Theory ISBN: 9783662557501
FCT
FCT
In this paper, we investigate the expressive power and the algorithmic properties of weighted expressions, which define functions from finite words to integers. First, we consider a slight extension of an expression formalism, introduced by Chatterje
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::76c5dbd24cb8d1b4a8dd6f0ea72918e9
https://doi.org/10.1007/978-3-662-55751-8_20
https://doi.org/10.1007/978-3-662-55751-8_20