Reactive bisimulation semantics for a process algebra with timeouts

HIGHLIGHTS

• who: Rob van Glabbeek from the Data61, CSIRO, Sydney have published the paper: Reactive bisimulation semantics for a process algebra with timeouts, in the Journal: (JOURNAL)
• what: (For the purposes of this proof, Table 1 is understood to have only 15 rules, even if each of them can be seen as a template, with an instance for each choice of R, S, I, S etc., and for each fitting choice of a transition labels a, u03b1 and/or u03b2.)
• how: This paper introduces the counterpart of strong bisimilarity for labelled transition systems extended . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or Email

  Password

  Remember me

  Lost your password?

  If you don't have an account, you can create one here.