All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”
EN
ČeštinaEnglish

Filters

1 378 (0,151s) •

Result

LTL to Büchi Automata: Improved Once Again

We present an improvement of an algorithm translating LTL formulae into Büchi automata via alternating automata. In particular, we improve the transformation of alternating Büchi automata to generalized

IN - Informatika

  • 2010
    • •
  • O
Result

Almost Linear Büchi Automata

We introduce a new class of Büchi automata (BA) called Almost linear Büchi automata (ALBA) and a corresponding fragment of Linear temporal logic (LTL) called LIO....

IN - Informatika

  • 2010
    • •
  • O
Result

Tighter Construction of Tight Büchi Automata

synthesis. There exists a translation of LTL formulas to tight Büchi automata and several translations of Büchi automata to equivalent tight Büchi automata. This paper presents another translatio...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2024
    • •
  • D
    • •
  • Link
Result

Is there a best Büchi automaton for explicit model checking?

LTL to Büchi automata (BA) translators are traditionally optimized to produce automata with a small number of states or a small number of non-deterministic states. In this paper, we search for properties of Büchi <...

IN - Informatika

  • 2014
    • •
  • D
    • •
  • Link
Result

LTL to Smaller Self-Loop Alternating Automata and Back

Self-loop alternating automata (SLAA) with Büchi or co-Büchi acceptance or nondeterministic automata. This paper considers SLAA with generic transition-based Emerson-Lei acceptance and presents translations of LTL ...

Computer and information sciences

  • 2019
    • •
  • D
    • •
  • Link
Result

LTL to Büchi Automata Translation: Fast and More Deterministic

We introduce improvements in the algorithm by Gastin and Oddoux translating LTL formulae into Büchi automata via very weak alternating co-Büchi automata and generalized Büchi automata. Several imp...

IN - Informatika

  • 2012
    • •
  • D
    • •
  • Link
Result

Complementing Semi-deterministic Büchi Automata

Büchi automata, which are Büchi automata that are deterministic in the limit: from in Ultimate Büchi Automizer, where these automata represent checked runs and have to study semi-deterministic

IN - Informatika

  • 2016
    • •
  • D
    • •
  • Link
Result

Almost Linear Büchi Automata

We introduce a new fragment of Linear temporal logic (LTL) called LIO and a new class of Büchi automata (BA) called Almost linear Büchi automata (ALBA). We provide effective translations between LIO and ALBA showin...

IN - Informatika

  • 2009
    • •
  • D
Result

Ranker: A Tool for Complementing Büchi Automata

Ranker is a tool for complementing Büchi automata, necessary, e.g., in automata-based model checking of reactive systems. It uses rank-based complementation as its basic procedure, but enriches it with many optimizations an...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2022
    • •
  • R
    • •
  • Link
Result

Seminator 2 Can Complement Generalized Büchi Automata via Improved Semi-determinization

transition-based generalized Büchi automata (TGBAs) into equivalent semi-deterministic automata. The tool has been extended with numerous optimizations and produces considerably smaller automata than its first ver...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2020
    • •
  • D
    • •
  • Link
  • 1 - 10 out of 1 378