Sciweavers

FSTTCS
2005
Springer
13 years 10 months ago
Semiperfect-Information Games
Much recent research has focused on the applications of games with ω-regular objectives in the control and verification of reactive systems. However, many of the game-based model...
Krishnendu Chatterjee, Thomas A. Henzinger
FSTTCS
2005
Springer
13 years 10 months ago
Reachability Analysis of Multithreaded Software with Asynchronous Communication
We introduce asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CP...
Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, J...
FSTTCS
2005
Springer
13 years 10 months ago
The Directed Planar Reachability Problem
We investigate the s-t-connectivity problem for directed planar graphs, which is hard for L and is contained in NL but is not known to be complete. We show that this problem is log...
Eric Allender, Samir Datta, Sambuddha Roy
FSTTCS
2005
Springer
13 years 10 months ago
When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?
In this paper4 , we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly in...
Béatrice Bérard, Franck Cassez, Serg...
FSTTCS
2005
Springer
13 years 10 months ago
Causal Closure for MSC Languages
Abstract. Message sequence charts (MSCs) are commonly used to specify interactions between agents in communicating systems. Their visual nature makes them attractive for describing...
Bharat Adsul, Madhavan Mukund, K. Narayan Kumar, V...
FSTTCS
2005
Springer
13 years 10 months ago
On the Expressiveness of TPTL and MTL
TPTL and MTL are two classical timed extensions of LTL. In this paper, we positively answer a 15-year-old conjecture that TPTL is strictly more expressive than MTL. But we show tha...
Patricia Bouyer, Fabrice Chevalier, Nicolas Markey