TY  - CHAP
AU  - Frutos Escrig, David De
AU  - Gregorio Rodríguez, Carlos
A4  - Abadi, Martín
A4  - De Alfaro, Luca
PY  - 2005
DO  - 10.1007/11539452_23
SN  - 978-3-540-28309-6
UR  - https://hdl.handle.net/20.500.14352/53218
AB  - Coinductive definitions of semantics based on bisimulations have rather pleasant properties and are simple to use. In order to get coinductive characterisations of those semantic equivalences that are weaker than strong bisimulation we use a variant...
LA  - eng
M2  - 278
PB  - Springer
KW  - Models and methods for concurrent and distributed computing
KW  - Process algebras bisimulation
KW  - Transition nets
KW  - Specification and verification
KW  - Program logics
KW  -  Model checking
TI  - Bisimulations Up-to for the Linear Time Branching Time Spectrum
TY  - book part
ER  -