A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
There are two ways to describe a state machine as an algebraic specification: a behavioral specification and a rewrite specificaon. In this study, we propose a translation system from behavioral specifations to rewrite specifications to obtain a verification system which has the strong points of verification techniques for both specifications. Since our translation system is complete with respect to invariant properties, it helps us to obtain a counter-example for an invariant property throughdoi:10.1093/ietisy/e91-d.5.1492 fatcat:jyvpvzd5uzarjgz3zwztb54sya