346 search results - page 37 / 70 » Determinizing Asynchronous Automata |
WIA
2007
Springer
15 years 4 months ago
2007
Springer
We study the pattern statistics representing the number of occurrences of a given string in a word of length n generated at random by rational stochastic models, defined by means ...
SPIN
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. In this article, we address the problem of statically determining an approximation of the communication topology of concurrent programs. These programs may contain dynami...
SERVICES
2008
14 years 11 months ago
2008
an abstract form of service composition where Web services are represented as nondeterministic communicating automata. Considering the case in which communication is done via chan...
FCS
2006
14 years 11 months ago
2006
: In this paper, functioning and interaction of distributed devices and concurrent algorithms are analyzed in the context of the theory of algorithms. Although different systems in...
VMCAI
2012
Springer
13 years 5 months ago
2012
Springer
Abstract. Recently, a general framework on characteristic formulae was proposed by Aceto et al. It offers a simple theory that allows one to easily obtain characteristic formulae o...