Stem büchi$ (all stems)

53 papers:

TACAS-2015-RenaultDKP #automaton #model checking #parallel

Parallel Explicit Model Checking for Generalized Büchi Automata (ER, ADL, FK, DP), pp. 613–627.

LATA-2015-ThiemannS #automaton #regular expression

From ω-Regular Expressions to Büchi Automata via Partial Derivatives (PT, MS), pp. 287–298.

AFL-2014-HutagalungLL #automaton #game studies #simulation

Buffered Simulation Games for Büchi Automata (MH, ML, ÉL), pp. 286–300.

LICS-CSL-2014-0001C #abstract interpretation #automaton

Abstract interpretation from Büchi automata (MH, WC), p. 10.

TACAS-2013-RenaultDKP #automaton #composition #model checking #performance

Strength-Based Decomposition of the Property Büchi Automaton for Faster Model Checking (ER, ADL, FK, DP), pp. 580–593.

LATA-2013-HutagalungLL #automaton #game studies #simulation

Revealing vs. Concealing: More Simulation Games for Büchi Inclusion (MH, ML, ÉL), pp. 347–358.

QAPL-2013-BertrandS #automaton #game studies #infinity #probability

Solving Stochastic Büchi Games on Infinite Decisive Arenas (NB, PS), pp. 116–131.

CAV-2013-LaarmanODLP #abstraction #automaton #manycore #using

Multi-core Emptiness Checking of Timed Büchi Automata Using Inclusion Abstraction (AL, MCO, AED, KGL, JvdP), pp. 968–983.

CSL-2013-ColcombetKLB #automaton

Deciding the weak definability of Büchi definable tree languages (TC, DK, CL, MVB), pp. 215–230.

FoSSaCS-2012-BreuersLO #automaton

Improved Ramsey-Based Büchi Complementation (SB, CL, JO), pp. 150–164.

TACAS-2012-BabiakKRS #automaton #ltl #performance

LTL to Büchi Automata Translation: Fast and More Deterministic (TB, MK, VR, JS), pp. 95–109.

SEKE-2012-SalamahEO #automaton #consistency #ltl #using

Consistency Checks of System Properties Using LTL and Büchi Automata (SS, ME, OO), pp. 39–44.

SAC-2012-KeshishzadehIM #automaton #framework #model checking

A Büchi automata based model checking framework for reo connectors (SK, MI, AM), pp. 1536–1543.

FASE-2011-LiXBL #automaton #model checking

Model Checking Büchi Pushdown Systems (JL, FX, TB, VL), pp. 141–155.

TACAS-2011-TsayTCC #automaton #repository

Büchi Store: An Open Repository of Büchi Automata (YKT, MHT, JSC, YWC), pp. 262–266.

CIAA-J-2010-KufleitnerL11 #automaton #order

Partially Ordered Two-Way BüChi Automata (MK, AL), pp. 1861–1876.

ICALP-v2-2011-Clemente #automaton

Büchi Automata Can Have Smaller Quotients (LC), pp. 258–270.

CAV-2011-ChatterjeeHJS #algorithm #analysis #automaton #markov #process

Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives (KC, MH, MJ, NS), pp. 260–276.

CSL-2011-FogartyKVW #automaton

Unifying Büchi Complementation Constructions (SF, OK, MYV, TW), pp. 248–263.

TAP-2011-Tan #automaton #metric #testing

State Coverage Metrics for Specification-Based Testing with Büchi Automata (LT), pp. 171–186.

VMCAI-2011-ChadhaSV #automaton #probability

Probabilistic Büchi Automata with Non-extremal Acceptance Thresholds (RC, APS, MV), pp. 103–117.

TACAS-2010-FogartyV #automaton #performance

Efficient Büchi Universality Checking (SF, MYV), pp. 205–220.

CIAA-2010-KufleitnerL #automaton #order

Partially Ordered Two-Way Büchi Automata (MK, AL), pp. 181–190.

CIAA-2010-TsaiFVT #automaton

State of Büchi Complementation (MHT, SF, MYV, YKT), pp. 261–271.

DLT-2010-DrosteV #automaton #bound #logic #multi #theorem

Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices (MD, HV), pp. 160–172.

ICALP-v2-2010-BokerKR #automaton

Alternation Removal in Büchi Automata (UB, OK, AR), pp. 76–87.

LATA-2010-BousquetL #ambiguity #automaton #equivalence #problem

Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata (NB, CL), pp. 118–129.

CAV-2010-AbdullaCCHHMV #automaton #simulation #testing

Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing (PAA, YFC, LC, LH, CDH, RM, TV), pp. 132–147.

CAV-2010-HerbreteauSW #automaton #performance

Efficient Emptiness Check for Timed Büchi Automata (FH, BS, IW), pp. 148–161.

CAV-2010-LiXBL #analysis #automaton #hardware #performance #reachability

Efficient Reachability Analysis of Büchi Pushdown Systems for Hardware/Software Co-verification (JL, FX, TB, VL), pp. 339–353.

SAT-2010-Ehlers #automaton #satisfiability #using

Minimising Deterministic Büchi Automata Precisely Using SAT Solving (RE), pp. 326–332.

FoSSaCS-2009-KupfermanP #automaton #bound

Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata (OK, NP), pp. 182–196.

FoSSaCS-2009-Schewe #automaton #bound #nondeterminism

Tighter Bounds for the Determinisation of Büchi Automata (SS), pp. 167–181.

TACAS-2009-FogartyV #automaton #termination

Büchi Complementation and Size-Change Termination (SF, MYV), pp. 16–30.

ICALP-v2-2009-ColcombetZ #automaton #bound

A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata (TC, KZ), pp. 151–162.

LICS-2009-BokerK #automaton

Co-ing Büchi Made Tight and Useful (UB, OK), pp. 245–254.

FoSSaCS-2008-BaierBG #automaton #on the #probability #problem

On Decision Problems for Probabilistic Büchi Automata (CB, NB, MG), pp. 287–301.

ICALP-A-2008-KahlerW #ambiguity #automaton

Complementation, Disambiguation, and Determinization of Büchi Automata Unified (DK, TW), pp. 724–735.

TACAS-2007-TsayCTWC #automaton #named #visual notation

GOAL: A Graphical Tool for Manipulating Büchi Automata and Temporal Formulae (YKT, YFC, MHT, KNW, WCC), pp. 466–471.

CAV-2006-HeljankoJKLL #automaton #bound #model checking

Bounded Model Checking for Weak Alternating Büchi Automata (KH, TAJ, MK, ML, TL), pp. 95–108.

CAV-2006-JuvekarP #automaton

Minimizing Generalized Büchi Automata (SJ, NP), pp. 45–58.

CIAA-2005-AlthoffTW #automaton

Observations on Determinization of Büchi Automata (CSA, WT, NW), pp. 262–272.

CIAA-2003-Fritz #automaton #linear #logic #simulation #using

Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata (CF), pp. 35–48.

ICALP-2001-EtessamiWS #automaton #game studies #reduction #simulation

Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata (KE, TW, RAS), pp. 694–707.

CAV-2001-BhatCG #automaton #model checking #performance

Efficient Model Checking Via Büchi Tableau Automata (GB, RC, AG), pp. 38–52.

CAV-2001-GastinO #automaton #ltl #performance

Fast LTL to Büchi Automata Translation (PG, DO), pp. 53–65.

CSL-2001-GalotaV #automaton #theorem

A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem (MG, HV), pp. 355–368.

ICALP-2000-Urbanski #automaton #on the

On Deciding if Deterministic Rabin Language Is in Büchi Class (TFU), pp. 663–674.

CAV-2000-SomenziB #automaton #ltl #performance

Efficient Büchi Automata from LTL Formulae (FS, RB), pp. 248–263.

ICALP-1996-Pin #automaton #calculus #first-order #power of

The Expressive Power of Existential First Order Sentences of Büchi’s Sequential Calculus (JÉP), pp. 300–311.

ICALP-1994-Muscholl #automaton #on the

On the Complementation of Büchi Asynchronous Cellular Automata (AM), pp. 142–153.

ICALP-1993-MichauxV #automaton #theorem

Cobham’s Ttheorem seen through Büchi’s Theorem (CM, RV), pp. 325–334.

ICALP-1985-SistlaVW #automaton #logic #problem

The Complementation Problem for Büchi Automata with Applications to Temporal Logic (Extended Abstract) (APS, MYV, PW), pp. 465–474.