Handbook of Finite State Based Models and Applications Discrete Mathematics and Its Applications Series
Coordonnateur : Wang Jiacun
Applicable to any problem that requires a finite number of solutions, finite state-based models (also called finite state machines or finite state automata) have found wide use in various areas of computer science and engineering. Handbook of Finite State Based Models and Applications provides a complete collection of introductory materials on finite state theories, algorithms, and the latest domain applications. For beginners, the book is a handy reference for quickly looking up model details. For more experienced researchers, it is suitable as a source of in-depth study in this area.
The book first introduces the fundamentals of automata theory, including regular expressions, as well as widely used automata, such as transducers, tree automata, quantum automata, and timed automata. It then presents algorithms for the minimization and incremental construction of finite automata and describes Esterel, an automata-based synchronous programming language for embedded system software development.
Moving on to applications, the book explores regular path queries on graph-structured data, timed automata in model checking security protocols, pattern matching, compiler design, and XML processing. It also covers other finite state-based modeling approaches and applications, including Petri nets, statecharts, temporal logic, and UML state machine diagrams.
Finite Automata. Large-Scale Regular Expression Matching on FPGA. Finite State Transducers. Tree Automata. Timed Automata. Quantum Finite Automata. Finite Automata Minimization. Incremental Construction of Finite-State Automata. Esterel and the Semantics of Causality. Regular Path Queries on Graph-Structured Data. Applying Timed Automata to Model Checking of Security Protocols. Optimal Adaptive Pattern-Matching Using Finite State Automata. Finite State Automata in Compilers. Finite State Models for XML Processing. Petri Nets. Statecharts. Model Checking. System Modeling with UML State Machines. Index.
Jiacun Wang is an associate professor and the chair of the Department of Computer Science and Software Engineering at Monmouth University in West Long Branch, New Jersey. Dr. Wang is a senior member of IEEE and an associate editor of IEEE Transactions on Systems, Man and Cybernetics, Part C. His research interests include software engineering, discrete event systems, formal methods, wireless networking, and real-time distributed systems.
Date de parution : 11-2016
17.8x25.4 cm
Date de parution : 11-2012
Ouvrage de 360 p.
17.8x25.4 cm
Thèmes de Handbook of Finite State Based Models and Applications :
Mots-clés :
State Based Models; UML State Machine; regular; Pushdown Automata; expression; Tree Automaton; automata; Timed Automata; language; Model Checking; timed; Input Symbol; automaton; Input String; transition; Input Alphabet; function; Petri Net; deterministic; Regular Languages; machines; NFA State; Initial State Q0; Composite State; Kleene Closure; Longest Common Prefix; Orthogonal Regions; Protocol State Machine; Closure Properties; FST; Light Controller; Hybrid Petri Nets; Deduction Rule; Continuous Petri Nets; Finite State Models