An Automata-Theoretic Approach to Fair Realizability and Synthesis

@inproceedings{Vardi1995AnAA,
  title={An Automata-Theoretic Approach to Fair Realizability and Synthesis},
  author={Moshe Y. Vardi},
  booktitle={CAV},
  year={1995}
}
Over the last few years, the automata-theoretic approach to realizability checking and synthesis of reactive modules, developed by Pnueli and Rosner, by Abadi, Lamport, and Wolper, and by Dill and Wong-Toi, has been quite successful, handling both the synchronous and the asynchronous cases. In this approach one transforms the specification into a tree automaton. The specification is realizable if this tree automaton is nonempty, i.e., accepts some infinite tree, and a finite representation of… CONTINUE READING
Highly Cited
This paper has 92 citations. REVIEW CITATIONS

Topics

Statistics

01020'99'01'03'05'07'09'11'13'15'17
Citations per Year

93 Citations

Semantic Scholar estimates that this publication has 93 citations based on the available data.

See our FAQ for additional information.