Abstract
In this paper we propose an axiomatic semantics for the synchronous language Esterel. We begin with giving a structural operational semantics for Esterel in terms of a labeled transition system (LTS). We prove that bisimulation on LTS states (which correspond to Esterel programs) is a congruence and that our LTS reflects the input /output behavior of programs. So, bisimilar programs are distinguished neither by any Esterel context nor by the external environment, and bisimulation is a reasonable notion of behavioral equivalence. In order to characterize equivalent programs, we give a set of axioms and we prove that they induce an axiomatization over Esterel which is sound and complete modulo bisimulation.
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.
