33 search results - page 3 / 7 » fsttcs 2004 |
FSTTCS
2004
Springer
13 years 10 months ago
2004
Springer
Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability priced timed game automata and prove ...
FSTTCS
2004
Springer
13 years 10 months ago
2004
Springer
This paper deals with distributed control problems by means of distributed games played on Mazurkiewicz traces. The main difference with other notions of distributed games recentl...
FSTTCS
2004
Springer
13 years 10 months ago
2004
Springer
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
FSTTCS
2004
Springer
13 years 10 months ago
2004
Springer
We introduce ctm, a process calculus which embodies a notion of trust for global computing systems. In ctm each principal (location) is equipped with a policy, which determines its...
FSTTCS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Monolithic finite-state probabilistic programs have been abstractly modeled by finite Markov chains, and the algorithmic verification problems for them have been inves...