A. Kick. Formula dependent model reduction through elimination of invisible transitions for checking fragments of CTL. Technical Report 1995-27, Universitat Karlsruhe, 1995.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....take a compositional approach to bisimulation minimization in a symbolic setting [2] This approach also performs minimization relative to a given property. However, it represents equivalence relations (rather than classes) Kick uses a symbolic technique to reduce models relative to properties [26]. This technique is not guaranteed to produce transition systems as coarse as those obtained through bisimulation; furthermore, it has not been tested on realistic examples. Bouajjani et al. minimize state graphs from programs using a combination of bisimulation and reachability [5] Lee and ....

A. Kick. Formula dependent model reduction through elimination of invisible transitions for checking fragments of CTL. Technical Report 1995-27, Universitat Karlsruhe, 1995.

....a compositional approach to bisimulation minimization in a symbolic setting [2] This approach also performs minimization relative to a given property. However, it represents equivalence re XV lations (rather than classes) Kick uses a symbolic technique to reduce models relative to properties [26]. This technique is not guaranteed to produce transition systems as coarse as those obtained through bisimulation; furthermore, it has not been tested on realistic examples. Bouajjani et al. minimize state graphs from programs using a combination of bisimulation and reachability [5] Lee and ....

A. Kick. Formula dependent model reduction through elimination of invisible transitions for checking fragments of CTL. Technical Report 1995-27, Universitat Karlsruhe, 1995.

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