History-determinism vs fair simulation

DOI10.4230/LIPICS.CONCUR.2024.12MaRDI QIDQ6859945zbMATH OpenFDO

Authors Udi Boker, Thomas A. Henzinger, Karoliina Lehtinen, Aditya Prakash

Publication date 10 February 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2024.12

zbMATH Keywords

history-determinism

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• A bit of nondeterminism makes pushdown automata expressive and succinct
• Alternating finite automata on -words
• Büchi Good-for-Games Automata Are Efficiently Recognizable
• Fair simulation
• Finite-memory automata
• History-determinism vs fair simulation
• History-deterministic timed automata
• On Guidable Index of Tree Automata
• On history-deterministic one-counter nets
• Solving Games Without Determinization
• Testing and generating infinite sequences by a finite automaton
• The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
• Token games and history-deterministic quantitative automata
• Visibly pushdown languages

Cited in

(2)

• History-determinism vs fair simulation
• Lookahead games and efficient determinisation of history-deterministic Büchi automata

This page was built for publication: History-determinism vs fair simulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6859945)