3229 search results - page 148 / 646 » The Theory of Timed Automata |
172
click to vote
FSTTCS
2005
Springer
16 years 11 hour ago
2005
Springer
Abstract. We identify a network of sequential processes that communicate by synchronizing frequently on common actions. More precisely, we demand that there is a bound k such that ...
185
click to vote
TSP
2010
15 years 1 months ago
2010
We derive a signal processing framework, called space signal processing, that parallels time signal processing. As such, it comes in four versions (continuous/discrete, infinite/fi...
150
click to vote
FOSSACS
2004
Springer
15 years 12 months ago
2004
Springer
Labelled Markov processes (LMPs) are automata whose transitions are given by probability distributions. In this paper we present a ‘universal’ LMP as the spectrum of a commutat...
180
click to vote
FMCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper addresses the problem of off-line selection of test cases for testing the conformance of a black-box implementation with respect to a specification, in the context of re...
144
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that player...