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}
}
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
4 Citations

References

SHOWING 1-10 OF 32 REFERENCES
Simulation-Based Iteration of Tree Transducers
  • 30
  • PDF
Abstract regular (tree) model checking
  • 45
  • PDF
On (Omega-)regular model checking
  • 11
  • PDF
Regular Tree Model Checking
  • 89
  • PDF
Extrapolating Tree Transformations
  • 70
  • PDF
Lattice Automata
  • 114
  • PDF
Parameterized Tree Systems
  • 12
  • Highly Influential
  • PDF
Tree automata techniques and applications
  • 1,481
  • PDF
...
1
2
3
4
...