Computing Stuttering Simulations

Simple item page
dc.creatorRanzato, Francesco
dc.creatorTapparo, Francesco
dc.date2009-04-09
dc.date.accessioned2026-07-07T13:01:55Z
dc.date.available2026-07-07T13:01:55Z
dc.descriptionStuttering bisimulation is a well-known behavioral equivalence that preserves CTL-X, namely CTL without the next-time operator X. Correspondingly, the stuttering simulation preorder induces a coarser behavioral equivalence that preserves the existential fragment ECTL-{X,G}, namely ECTL without the next-time X and globally G operators. While stuttering bisimulation equivalence can be computed by the well-known Groote and Vaandrager's [1990] algorithm, to the best of our knowledge, no algorithm for computing the stuttering simulation preorder and equivalence is available. This paper presents such an algorithm for finite state systems.
dc.identifierhttps://arxiv.org/abs/0904.1488
dc.identifierhttp://arxiv.org/abs/0904.1488
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/226313
dc.subjectLogic in Computer Science
dc.titleComputing Stuttering Simulations
dc.typetext

Files

Collections

arXiv