346 search results - page 16 / 70 » Determinizing Asynchronous Automata |
RTSS
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract—We apply automata theory to specifying behavioral interfaces of objects and show how to check schedulability and compatibility of real time asynchronous objects. The beh...
FSTTCS
2005
Springer
15 years 3 months ago
2005
Springer
We introduce asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CP...
126
click to vote
PODC
1992
ACM
15 years 2 months ago
1992
ACM
We determine what information about failures is necessary and sufficient to solve Consensus in asynchronous distributed systems subject to crash failures. In Chandra and Toueg [199...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic t...