128 search results - page 1 / 26 » Game Characterizations of Process Equivalences |
APLAS
2008
ACM
13 years 6 months ago
2008
ACM
In this paper we propose a hierarchy of games that allows us to make a systematic comparison of process equivalences by characterizing process equivalences as games. The well-known...
AI
2006
Springer
13 years 8 months ago
2006
Springer
In the context of probabilistic verification, we provide a new notion of trace-equivalence divergence between pairs of Labelled Markov processes. This divergence corresponds to the...
ESEM
2010
ACM
13 years 5 months ago
2010
ACM
Though very important in software engineering, linking artifacts of the same type (clone detection) or of different types (traceability recovery) is extremely tedious, error-prone...
ATAL
2010
Springer
13 years 6 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
ENTCS
1998
13 years 4 months ago
1998
We consider a generalisation of Larsen and Skou’s [19] reactive probabilistic transition systems which exhibit three kinds of choice: action-guarded probabilistic choice, extern...