Sciweavers

1724 search results - page 197 / 345
» Models for Concurrency
Sort
View
LICS
1996
IEEE
15 years 2 months ago
Reactive Modules
We present a formal model for concurrent systems. The model represents synchronous and asynchronous components in a uniform framework that supports compositional (assume-guarantee)...
Rajeev Alur, Thomas A. Henzinger
ICALP
1994
Springer
15 years 2 months ago
Liveness in Timed and Untimed Systems
When provingthe correctness of algorithmsin distributed systems, one generally considers safety conditions and liveness conditions. The Input Output I O automaton model and its ti...
Rainer Gawlick, Roberto Segala, Jørgen F. S...
RP
2009
Springer
124views Control Systems» more  RP 2009»
15 years 4 months ago
Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
Dynamic networks of Pushdown Systems (PDN in short) have been introduced to perform static analysis of concurrent programs that may spawn threads dynamically. In this model the se...
Denis Lugiez
RTAS
2008
IEEE
15 years 4 months ago
Real-Time Distributed Discrete-Event Execution with Fault Tolerance
We build on PTIDES, a programming model for distributed embedded systems that uses discrete-event (DE) models as program specifications. PTIDES improves on distributed DE executi...
Thomas Huining Feng, Edward A. Lee
POPL
2012
ACM
13 years 5 months ago
Analysis of recursively parallel programs
We propose a general formal model of isolated hierarchical parallel computations, and identify several fragments to match the concurrency constructs present in real-world programm...
Ahmed Bouajjani, Michael Emmi