Home » Handbook of Finite State Based Models and Applications
Product Image

Handbook of Finite State Based Models and Applications

€78.99
Quantity:
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
14 days return policy Shipping & Delivery
advanced compiler techniques
automata
automata based system modeling applications
automata theory
automaton
Category=PBC
Category=UMB
Category=UMZ
Closure Properties
compiler design
Composite State
computational theory
Continuous Petri Nets
Deduction Rule
deterministic
embedded system software development
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Esterel
expression
finite state automata
Finite State Based Models
finite state machines
Finite State Models
FPGA design
FST
function
graph data analysis
Hybrid Petri Nets
Initial State Q0
Input Alphabet
Input String
Input Symbol
Kleene Closure
language
Light Controller
Longest Common Prefix
machines
Model Checking
model checking security protocols
NFA State
Orthogonal Regions
pattern matching
Petri Net
Petri nets
problem requiring a finite number of solutions
Protocol State Machine
Pushdown Automata
quantum automata
regular
regular expression algorithms
Regular Languages
regular path queries on graph-structured data
security protocol verification
State Based Models
statecharts
synchronous programming
temporal logic
timed
Timed Automata
transition
Tree Automaton
UML State Machine
UML state machine diagrams
XML processing

Product details

  • ISBN 9781138199354
  • Weight: 770g
  • Dimensions: 178 x 254mm
  • Publication Date: 16 Nov 2016
  • Publisher: Taylor & Francis Ltd
  • Publication City/Country: GB
  • Product Form: Paperback
Secure checkout Fast Shipping Easy returns
Description

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.
About

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.