Abstract
Symbolic transition graphs of Hennessy and Linextended with assignments are used to represent parametrisedvalue-passing processes. Semantics appealing to thenotion of state is introduced for the symbolic transition graphsand their extended version. Showing strong early bisimulation between finite symbolic transition graphs extended with assignments isreduced to solving sets of equations involving first-order state formulas.
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.
