Sciweavers

Share
197 search results - page 1 / 40
» Undecidability Results for Distributed Probabilistic Systems
Sort
View
SBMF
2009
Springer
126views Formal Methods» more  SBMF 2009»
12 years 6 months ago
Undecidability Results for Distributed Probabilistic Systems
Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such ev...
Sergio Giro
ATVA
2010
Springer
114views Hardware» more  ATVA 2010»
12 years 1 months ago
Methods for Knowledge Based Controlling of Distributed Systems
Abstract. Controlling concurrent systems to impose some global invariant is an undecidable problem. One can gain decidability at the expense of reducing concurrency. Even under thi...
Saddek Bensalem, Marius Bozga, Susanne Graf, Doron...
CORR
2010
Springer
103views Education» more  CORR 2010»
12 years 1 months ago
Probabilistic regular graphs
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
Nathalie Bertrand, Christophe Morvan
FSTTCS
2004
Springer
12 years 7 months ago
Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems
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...
Paul Gastin, Benjamin Lerman, Marc Zeitoun
LICS
2005
IEEE
12 years 7 months ago
Uniform Distributed Synthesis
We provide a uniform solution to the problem of synthesizing a finite-state distributed system. An instance of the synthesis problem consists of a system architecture and a tempo...
Bernd Finkbeiner, Sven Schewe
books