Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Mazzocchi, Nicolas"'
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
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
We propose a novel algorithm to decide the language inclusion between (nondeterministic) B\"uchi automata, a PSPACE-complete problem. Our approach, like others before, leverage a notion of quasiorder to prune the search for a counterexample by discar
Externí odkaz:
http://arxiv.org/abs/2207.13549
Autor:
Mazzocchi, Nicolas
Reactive systems are computer systems that maintain continuous interaction with the environment in which they operate. Such systems are nowadays part of our daily life: think about common yet critical applications like engine control units in automot
A deterministic finite automaton (DFA) is composite if its language can be decomposed into an intersection of languages of smaller DFAs. Otherwise, A is prime. This notion of primality was introduced by Kupferman and Mosheiff in 2013, and while they
Externí odkaz:
http://arxiv.org/abs/2107.04683
Parikh automata extend automata with counters whose values can only be tested at the end of the computation, with respect to membership into a semi-linear set. Parikh automata have found several applications, for instance in transducer theory, as the
Externí odkaz:
http://arxiv.org/abs/1907.09362
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:
http://arxiv.org/abs/1810.03515