Result Details

Simulations and Antichains for Efficient Handling of Finite Automata

HOLÍK, L. Simulations and Antichains for Efficient Handling of Finite Automata. Brno: Department of Intelligent Systems FIT BUT, 2011. 128 p.
Type
dissertation
Language
English
Authors
Keywords

Finite automata, finite tree automata, alternating Büchi automata, nondeterminism,
simulation, bisimulation, universality, language inclusion, antichain,
quotienting, regular tree model checking.

Published
2011
Pages
128
Publisher
Department of Intelligent Systems FIT BUT
Place
Brno
BibTeX
@misc{BUT192737,
  author="Lukáš {Holík}",
  title="Simulations and Antichains for Efficient Handling of Finite Automata",
  year="2011",
  pages="128",
  publisher="Department of Intelligent Systems FIT BUT",
  address="Brno",
  url="https://www.fit.vut.cz/research/publication/9517/"
}
Files
Projects
Advanced Formal Approaches in the Design and Verification of Computer-Based Systems, GACR, Standardní projekty, GA102/07/0322, start: 2007-01-01, end: 2009-12-31, completed
Dealing with Complex Data Structures and Concurrency within the Rich Model Toolkit, MŠMT, COST, OC10009, start: 2010-01-01, end: 2012-12-31, running
Mathematical and Engineering Approaches to Developing Reliable and Secure Concurrent and Distributed Computer Systems, GACR, Doktorské granty, GD102/09/H042, start: 2009-01-30, end: 2012-12-31, completed
Secured, reliable and adaptive computer systems, BUT, Vnitřní projekty VUT, FIT-S-10-1, start: 2010-03-01, end: 2010-12-31, completed
Security-Oriented Research in Information Technology, MŠMT, Institucionální prostředky SR ČR (např. VZ, VC), MSM0021630528, start: 2007-01-01, end: 2013-12-31, running
Static and Dynamic Verification of Programs with Advanced Features of Concurrency and Unboundedness, GACR, Standardní projekty, GAP103/10/0306, start: 2010-01-01, end: 2013-12-31, running
Research groups
Departments
Back to top