Abstract
In this paper an algorithm is proposed which removes the synchronous behavior of events in automata. This is done such that a modular implementation is possible in any sequential programming language. The goal is to find automata which resemble the original automata, but do not contain synchronizing events. Moreover, these new automata, when put in parallel, must behave the same as the original system. The algorithm imposes three steps to end up with a transformed automata network. The final result yields automata which have exactly one edge for each event and each event is unique to a certain automaton. The placement of events in the final result is based on a partitioning of events. To shown applicability of the algorithm, it has been applied to a large industrial-sized system. For this system a controller is made, based on the automata model of the requirements and specifications.
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.
