5 research outputs found
Singly Exponential Translation of Alternating Weak Büchi Automata to Unambiguous Büchi Automata
We introduce a method for translating an alternating weak B\"uchi automaton
(AWA), which corresponds to a Linear Dynamic Logic (LDL) formula, to an
unambiguous B\"uchi automaton (UBA). Our translations generalise constructions
for Linear Temporal Logic (LTL), a less expressive specification language than
LDL. In classical constructions, LTL formulas are first translated to
alternating \emph{very weak} automata (AVAs) -- automata that have only
singleton strongly connected components (SCCs); the AVAs are then handled by
efficient disambiguation procedures. However, general AWAs can have larger
SCCs, which complicates disambiguation. Currently, the only available
disambiguation procedure has to go through an intermediate construction of
nondeterministic B\"uchi automata (NBAs), which would incur an exponential
blow-up of its own. We introduce a translation from \emph{general} AWAs to UBAs
with a \emph{singly} exponential blow-up, which also immediately provides a
singly exponential translation from LDL to UBAs. Interestingly, the complexity
of our translation is \emph{smaller} than the best known disambiguation
algorithm for NBAs (broadly vs. ), while the input of
our construction can be exponentially more succinct
Computer Aided Verification
The open access two-volume set LNCS 12224 and 12225 constitutes the refereed proceedings of the 32st International Conference on Computer Aided Verification, CAV 2020, held in Los Angeles, CA, USA, in July 2020.* The 43 full papers presented together with 18 tool papers and 4 case studies, were carefully reviewed and selected from 240 submissions. The papers were organized in the following topical sections: Part I: AI verification; blockchain and Security; Concurrency; hardware verification and decision procedures; and hybrid and dynamic systems. Part II: model checking; software verification; stochastic systems; and synthesis. *The conference was held virtually due to the COVID-19 pandemic
Computer Aided Verification
This open access two-volume set LNCS 10980 and 10981 constitutes the refereed proceedings of the 30th International Conference on Computer Aided Verification, CAV 2018, held in Oxford, UK, in July 2018. The 52 full and 13 tool papers presented together with 3 invited papers and 2 tutorials were carefully reviewed and selected from 215 submissions. The papers cover a wide range of topics and techniques, from algorithmic and logical foundations of verification to practical applications in distributed, networked, cyber-physical, and autonomous systems. They are organized in topical sections on model checking, program analysis using polyhedra, synthesis, learning, runtime verification, hybrid and timed systems, tools, probabilistic systems, static analysis, theory and security, SAT, SMT and decisions procedures, concurrency, and CPS, hardware, industrial applications
Computer Aided Verification
This open access two-volume set LNCS 10980 and 10981 constitutes the refereed proceedings of the 30th International Conference on Computer Aided Verification, CAV 2018, held in Oxford, UK, in July 2018. The 52 full and 13 tool papers presented together with 3 invited papers and 2 tutorials were carefully reviewed and selected from 215 submissions. The papers cover a wide range of topics and techniques, from algorithmic and logical foundations of verification to practical applications in distributed, networked, cyber-physical, and autonomous systems. They are organized in topical sections on model checking, program analysis using polyhedra, synthesis, learning, runtime verification, hybrid and timed systems, tools, probabilistic systems, static analysis, theory and security, SAT, SMT and decisions procedures, concurrency, and CPS, hardware, industrial applications