|
| | | | |
| | | |
| Stat |
Members: 3644
Articles: 2'497'992
Articles rated: 2609
16 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Game Characterizations of Timed Relations for Timed Automata Processes | | Shibashis Guha
; Shankara Narayanan Krishna
; | | Date: |
28 Jun 2012 | | Abstract: | In this work, we design the game semantics for timed equivalences and
preorders of timed processes. The timed games corresponding to the various
timed relations form a hierarchy. These games are similar to Stirling’s
bisimulation games. If it is the case that the existence of a winning strategy
for the defender in a game ${cal G}_1$ implies that there exists a winning
strategy for the defender in another game ${cal G}_2$, then the relation that
corresponds to ${cal G}_1$ is stronger than the relation corresponding to
${cal G}_2$. The game hierarchy also throws light into several timed relations
that are not considered in this paper. | | Source: | arXiv, 1206.6565 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER