Games for Bisimulations and Abstraction
Weak bisimulations are typically used in process algebras where silent steps are used to abstract from internal behaviours. They facilitate relating implementations to specifications. When an implementation fails to conform to its specification, pinpointing the root cause can be challenging. In this...
Main Authors: | David De Frutos Escrig, Jeroen J. A. Keiren, Tim A. C. Willemse |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2017-11-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/2192/pdf |
Similar Items
-
Lowerbounds for Bisimulation by Partition Refinement
by: Jan Friso Groote, et al.
Published: (2023-05-01) -
Nash Equilibrium and Bisimulation Invariance
by: Julian Gutierrez, et al.
Published: (2019-09-01) -
Bisimulations for Delimited-Control Operators
by: Dariusz Biernacki, et al.
Published: (2019-05-01) -
The Complexity of Bisimulation and Simulation on Finite Systems
by: Moses Ganardi, et al.
Published: (2018-10-01) -
Bisimulations Meet PCTL Equivalences for Probabilistic Automata
by: Lei Song, et al.
Published: (2013-06-01)