Sciweavers

11112 search results - page 1 / 2223
» Computing Stuttering Simulations
Sort
View
CONCUR
2009
Springer
13 years 11 months ago
Computing Stuttering Simulations
Stuttering bisimulation is a well-known behavioural equivalence that preserves CTL-X, namely CTL without the next-time operator X. Correspondingly, the stuttering simulation preord...
Francesco Ranzato, Francesco Tapparo
ENTCS
2008
128views more  ENTCS 2008»
13 years 5 months ago
Algebraic Stuttering Simulations
Rewrite theories and their associated Kripke structures constitute a flexible and executable framework in which a wide range of systems can be studied. We present a general notion...
Narciso Martí-Oliet, José Meseguer, ...
AMAST
2006
Springer
13 years 8 months ago
State Space Reduction of Rewrite Theories Using Invisible Transitions
Abstract. State space explosion is the hardest challenge to the effective application of model checking methods. We present a new technique for achieving drastic state space reduct...
Azadeh Farzan, José Meseguer
IANDC
2008
114views more  IANDC 2008»
13 years 5 months ago
Generalizing the Paige-Tarjan algorithm by abstract interpretation
act Interpretation Francesco Ranzato and Francesco Tapparo Dipartimento di Matematica Pura ed Applicata, Universit`a di Padova, Italy The Paige and Tarjan algorithm (PT) for comp...
Francesco Ranzato, Francesco Tapparo
IANDC
2008
81views more  IANDC 2008»
13 years 5 months ago
Universal extensions to simulate specifications
A previous paper introduced eternity variables as an alternative to the prophecy variables of Abadi and Lamport and proved the formalism to be semantically complete: every simulat...
Wim H. Hesselink