Zobrazeno 1 - 10
of 114
pro vyhledávání: '"Sarac N."'
System behaviors are traditionally evaluated through binary classifications of correctness, which do not suffice for properties involving quantitative aspects of systems and executions. Quantitative automata offer a more nuanced approach, mapping eac
Externí odkaz:
http://arxiv.org/abs/2409.03569
In distributed systems with processes that do not share a global clock, \emph{partial synchrony} is achieved by clock synchronization that guarantees bounded clock skew among all applications. Existing solutions for distributed runtime verification u
Externí odkaz:
http://arxiv.org/abs/2408.05033
We study the following refinement relation between nondeterministic state-transition models: model B strategically dominates model A iff every deterministic refinement of A is language contained in some deterministic refinement of B. While language c
Externí odkaz:
http://arxiv.org/abs/2407.10473
Safety and liveness stand as fundamental concepts in formal languages, playing a key role in verification. The safety-liveness classification of boolean properties characterizes whether a given property can be falsified by observing a finite prefix o
Externí odkaz:
http://arxiv.org/abs/2307.06016
The operator precedence languages (OPLs) represent the largest known subclass of the context-free languages which enjoys all desirable closure and decidability properties. This includes the decidability of language inclusion, which is the ultimate ve
Externí odkaz:
http://arxiv.org/abs/2305.03447
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:
http://arxiv.org/abs/2301.11175
Autor:
Henzinger, Thomas A., Saraç, N. Ege
In runtime verification, a monitor watches a trace of a system and, if possible, decides after observing each finite prefix whether or not the unknown infinite trace satisfies a given specification. We generalize the theory of runtime verification to
Externí odkaz:
http://arxiv.org/abs/2105.08353
Autor:
Saraç, N. Ege, Altun, Ömer Faruk, Atam, Kamil Tolga, Karahoda, Sertaç, Kaya, Kamer, Yenigün, Hüsnü
Publikováno v:
In Expert Systems With Applications 1 April 2021 167
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.