Abstract

We introduce ω-extended regular expressions (ωEREs) that can be used for specifying and proving properties of the set of finite of infinite event sequences that occur in a system. The ability of ωEREs to deal with infinite as well as finite sequences allows us to specify and verify eventuality and liveness properties quite naturally. ωEREs have a number of operators similar to those found in temporal logic and they are suitable for expressing temporal properties of systems. The problem of verifying properties of a system can be formulated as the containment problem for two ωEREs which is solvable. The use of ωEREs for specification and verification is illustrated with an example of a class of logical circuits called ‘decentralized daisy chain arbiters’ that are used for arbitrating between the requests issued by a number of concurrent processes.

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 call

Disclaimer: 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.