Corpus ID: 10162436

Tree Regular Model Checking for Lattice-Based Automata

@article{Genet2012TreeRM,
  title={Tree Regular Model Checking for Lattice-Based Automata},
  author={Thomas Genet and T. L. Gall and Axel Legay and V. Murat},
  journal={ArXiv},
  year={2012},
  volume={abs/1203.1495}
}

• Thomas Genet, T. L. Gall, +1 author V. Murat
• Published 2012
• Computer Science, Mathematics
• ArXiv

Tree Regular Model Checking (TRMC) is the name of a family of techniques for analyzing infinite-state systems in which states are represented by terms, and sets of states by Tree Automata (TA). The central problem in TRMC is to decide whether a set of bad states is reachable. The problem of computing a TA representing (an over- approximation of) the set of reachable states is undecidable, but efficient solutions based on completion or iteration of tree transducers exist. Unfortunately, the TRMC… Expand

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed