This book surveys the automata theoretic techniques that are required for model checking and satisfiability of expressive extensions of LTL that are used in specification of hardware designs. The motivation for studying these issues was the work done in Intel on a specification language for hardware model checking that extends LTL, later to be named ForSpec. While ForSpec does not include automata as temporal connectives, the backend tool, that handles the translation of ForSpec does. This led to the renewed study of automata connectives, and how to best handle them with alternating automata.

This book constitutes the proceedings of the 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2013, held in Rome, Italy, in March 2013. The 42 papers presented in this volume were carefully reviewed and selected from 172 submissions. They are organized in topical sections named: Markov chains; termination; SAT/SMT; games and synthesis; process algebra; pushdown; runtime verification and model checking; concurrency; learning and abduction; timed automata; security and access control; frontiers (graphics and quantum); functional programs...