Verifying Finite-State Graph Grammars: An Unfolding-Based Approach.

Paolo Baldan Andrea Corradini Barbara König

Published in: CONCUR (2004)

Keyphrases

finite state
graph grammars
context free
model checking
markov chain
context sensitive
markov decision processes
optimal policy
hidden markov models
low level
dynamic programming
knowledge based systems
n gram
production rules
tree automata