Sciweavers

311 search results - page 29 / 63
» DisCComp - A Formal Model for Distributed Concurrent Compone...
Sort
View
SBMF
2009
Springer
126views Formal Methods» more  SBMF 2009»
14 years 29 days 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
CONCUR
2007
Springer
14 years 2 months ago
Fair Cooperative Multithreading
Abstract. We propose a new operational model for shared variable concurrency, in the context of a concurrent, higher-order imperative language `a la ML. In our model the scheduling...
Gérard Boudol
SOFSEM
2007
Springer
14 years 2 months ago
Games, Time, and Probability: Graph Models for System Design and Analysis
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
Thomas A. Henzinger
ATAL
2007
Springer
14 years 2 months ago
Modular interpreted systems
We propose a new class of representations that can be used for modeling (and model checking) temporal, strategic and epistemic properties of agents and their teams. Our representa...
Wojciech Jamroga, Thomas Ågotnes
PPOPP
2005
ACM
14 years 2 months ago
Teleport messaging for distributed stream programs
In this paper, we develop a new language construct to address one of the pitfalls of parallel programming: precise handling of events across parallel components. The construct, te...
William Thies, Michal Karczmarek, Janis Sermulins,...