Abstract
The UML notation provides multiple diagrams for specifying the behavior of systems including state machine diagrams. However, its definition has not been formalized which prohibits the verification of correct behavior of the modeled systems. The pi-calculus has a rich theory and tools which make it possible to analyze and verify any system. Thus, mapping UML state machine diagrams into the pi-calculus could improve the verification task of these behavioral diagrams, but a more promising way is to directly build a pi-calculus model, to check it and then automatically map it to a UML state machine model. To do so, we need a mechanism which supports such tasks. We have chosen in our work the Triple Graph Grammars (TGGs) to develop an automatic bidirectional mapping between UML state machine diagrams and pi-calculus
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.
