Abstract
Synchronous paradigm exemplified by languages such as Esterel and Statecharts has been found to be useful for programming reactive applications. In this paper, we define a notion of refinement for the synchronous paradigm satisfying the following: A concurrent or hierarchical program refines its syntactic subcomponents and if a program has a property then any program that refines it also has the same property. These suggest a simple compositional verification strategy: in order to verify a program, verify one or more of its syntactic subprograms.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
