Abstract
In verification of complex computing systems, the concept of testing equivalence is frequently used. One of the ways to solve the problem of recognizing timed testing equivalences in the framework of the model of timed event structures with internal actions is to reduce it to formula verification on a model (model-checking). To this end, logical formulas characterizing timed event structure up to test pre-orders are constructed. In the paper, composition methods for characteristic formulas that do not rely on region and class graphs are considered, which simplifies construction of the characteristic formulas.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
