Sciweavers

CONCUR
1999
Springer
14 years 1 days ago
Robust Satisfaction
In order to check whether an open system satisfies a desired property, we need to check the behavior of the system with respect to an arbitrary environment. In the most general se...
Orna Kupferman, Moshe Y. Vardi
CONCUR
1999
Springer
14 years 1 days ago
Rectangular Hybrid Games
Thomas A. Henzinger, Benjamin Horowitz, Rupak Maju...
CONCUR
1999
Springer
14 years 1 days ago
Object Types against Races
This paper investigates an approach for statically preventing race conditions in an object-oriented language. The setting of this work is a variant of Gordon and Hankin’s concurr...
Cormac Flanagan, Martín Abadi
CONCUR
1999
Springer
14 years 1 days ago
An Unfolding Algorithm for Synchronous Products of Transition Systems
Abstract. The unfolding method, initially introduced for systems modelled by Petri nets, is applied to synchronous products of transition systems, a model introduced by Arnold [2]....
Javier Esparza, Stefan Römer
CONCUR
1999
Springer
14 years 1 days ago
From Synchrony to Asynchrony
Abstract. We present an in-depth discussion of the relationships between synchrony and asynchrony. Simple models of both paradigms are presented, and we state theorems which guaran...
Albert Benveniste, Benoît Caillaud, Paul Le ...
CONCUR
1999
Springer
14 years 1 days ago
Approximate Symbolic Model Checking of Continuous-Time Markov Chains
d abstract) Christel Baiera, Joost-Pieter Katoenb;c and Holger Hermannsc aLehrstuhl fur Praktische Informatik II, University of Mannheim 68131 Mannheim, Germany bLehrstuhl fur Info...
Christel Baier, Joost-Pieter Katoen, Holger Herman...
IPPS
1999
IEEE
14 years 1 days ago
An Efficient Logging Algorithm for Incremental Replay of Message
To support incremental replay of message-passing applications, processes must periodically checkpoint and the content of some messages must be logged, to break dependencies of the...
Franco Zambonelli
IPPS
1999
IEEE
14 years 1 days ago
Compiler Analysis to Support Compiled Communication for HPF-Like Programs
By managing network resources at compile time, the compiled communication technique greatly improves the communication performance for communication patterns that are known at com...
Xin Yuan, Rajiv Gupta, Rami G. Melhem
IPPS
1999
IEEE
14 years 1 days ago
Optimal Scheduling Algorithms in WDM Optical Passive Star Networks
All-to-all broadcast scheduling problems are considered in WDM optical passive star networks where k wavelengths are available in the network. It is assumed that each node has exac...
Hongjin Yeh, Kyubum Wee, Manpyo Hong
IPPS
1999
IEEE
14 years 1 days ago
The Recursive Grid Layout Scheme for VLSI Layout of Hierarchical Networks
We propose the recursive grid layout scheme for deriving efficient layouts of a variety of hierarchical networks and computing upper bounds on the VLSI area of general hierarchica...
Chi-Hsiang Yeh, Behrooz Parhami, Emmanouel A. Varv...