Abstract
AbstractA method for extending the behavioral specification and verification of state machine networks by event sequences to non‐deterministic behavior is presented. The nondeterministic behavior is described by a function between sets of event sequences instead of between sequences. Both the module composition and loop connection operations are modeled by the function composition and the least fixed point, respectively, just as in the deterministic case. Two application examples are described. The example with alternating bit protocol via unreliable communication lines indicates that the method detects the possibility of message stack just as the verification by temporal logic does, while the proof steps of our method are shorter. The second example discusses the cause of the Brock‐Ackerman anomaly and a condition to avoid it.
Sign-in/Register to access full text options 
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.
