Abstract
In this paper we propose a quite general process language called ℘, which can be suitably instantiated to model the synchronous language statecharts. The main novelty of the language is an operator of process refinement for representing statecharts hierarchy. Moreover, we define a compositional proof system for checking μ-calculus properties of ℘ processes. Such a proof system is sound in general and it is complete for finite-state processes including the one corresponding to statecharts.
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.
