343 search results - page 17 / 69 » On Making Directed Graphs Transitive |
127
click to vote
FSTTCS
2008
Springer
15 years 6 months ago
2008
Springer
An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by ...
155
Voted
LICS
2003
IEEE
15 years 10 months ago
2003
IEEE
We define the class of micro-macro stack graphs, a new class of graphs modeling infinite-state sequential systems with a decidable model-checking problem. Micro-macro stack grap...
139
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
133
click to vote
AIME
2007
Springer
15 years 11 months ago
2007
Springer
Reification of parthood relations according to the SEP-triplet encoding pattern has been employed in the clinical terminology SNOMED CT to simulate transitivity of the part-of rel...
158
Voted
CONCUR
2006
Springer
15 years 8 months ago
2006
Springer
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...