Efficient Büchi Automata from LTL Formulae

This publication has 11 references indexed in Scilit:

• Symbolic model checking: 1020 States and beyond
  Published by Elsevier ,2004
• Freedom, weakness, and determinism: from linear-time to branching-time
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Improved Automata Generation for Linear Temporal Logic
  Published by Springer Nature ,1999
• Efficient Decision Procedures for Model Checking of Linear Time Logic Properties
  Published by Springer Nature ,1999
• Algorithmic verification of linear temporal logic specifications
  Published by Springer Nature ,1998
• Checking that finite state concurrent programs satisfy their linear specification
  Published by Association for Computing Machinery (ACM) ,1985
• Logic Minimization Algorithms for VLSI Synthesis
  Published by Springer Nature ,1984
• Reasoning about infinite computation paths
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1983
• A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks
  IEEE Transactions on Electronic Computers, 1965
• Minimization of Boolean Functions*
  Bell System Technical Journal, 1956