D. VERGAMINI, Verilcatio by Memos o Observatioal Equivalece o Automata, INRIA report 501 (956). Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
The Esterel Synchronous Programming Language: Design.. - Berry, Gonthier (1992) (443 citations) (Correct)
....Automata obviously yield excellent and measuralle run time efficiency. They are also mathematically well known. Non trivial correctness proofs can be performed by automatic temporal logic formula checkers such as EMC [21] MEC [2] XESAR [39] or by automata observation systems such as AUTO [43, 42]. However, the human design and maintenance of automata turns out to be very difficult and error prone. Nontrivial automata are difficult to draw and impossible to understand when not drawn. Small changes in specifications can involve deep changes in automata. Run time actions must be duplicated ....
D. VERGAMINI, Verilcatio by Memos o Observatioal Equivalece o Automata, INRIA report 501 (956).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC