F. Balarin and A.L. Sangiovanni-Vincentelli. Iterative algorithms for formal verification of embedded real-time systems. In Proc. of ICCAD, 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....a case study involving timing properties of the Ethernet protocol, as formally specified by Weinberg and Zuck [22] Previous attempts at verifying this protocol either abstracted away from timing information, or used drastically simpler models. Related work Alur et al. 3] and Balarin et al. [4, 5] describe approximation algorithms which use a different methodology from ours. Their approach assumes that not many timing constraints in the system are necessary for its correct operation. They initially attempt to verify the system based only on logical constraints. Additional untimed processes ....

F. Balarin and A.L. Sangiovanni-Vincentelli. Iterative algorithms for formal verification of embedded real-time systems. In Proc. of ICCAD, 1994.

....by relaxing state assertions. For the verification of hybrid systems that are primarily discrete but include clocks, we recommend the use of specialized tools for the restricted class of timed automata. Symbolic model checkers for timed automata include Kronos [13] timed Cospan [7] timed Hsis [8], Uppaal [9] and Veriti [15] These systems use algorithms that are specific to clocks, and therefore are more 12 Thomas A. Henzinger et al. HyTech: A Model Checker for Hybrid Systems Time: 0.00 Location: on x = 2 y = 0 z = 0 VIA 0.50 time units Time: ....

F. Balarin and A. L. Sangiovanni-Vincentelli. Iterative algorithms for formal verification of embedded real-time systems. In ICCAD 94: International Conference on Computer Aided Design, pages 450--457, 1994.

....by relaxing state assertions. For the verification of hybrid systems that are primarily discrete but include clocks, we recommend the use of specialized tools for the restricted class of timed automata. Symbolic model checkers for timed automata include Kronos [13] timed Cospan [7] timed Hsis [8], Uppaal [9] and Veriti [15] These systems use algorithms that are specific to clocks, and therefore are more efficient for clock systems than the more general algorithms of HyTech. For the analysis of hybrid systems whose complexity is primarily in the continuous domain, we recommend the use ....

F. Balarin and A. L. Sangiovanni-Vincentelli. Iterative algorithms for formal verification of embedded real-time systems. In ICCAD 94: International Conference on Computer Aided Design, pages 450--457, 1994.

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