Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
66
click to vote
FOCS
1998
IEEE
80
views
Theoretical Computer Science
»
more
FOCS 1998
»
Concurrent Reachability Games
15 years 7 months ago
Download
mtc.epfl.ch
Luca de Alfaro, Thomas A. Henzinger, Orna Kupferma
Real-time Traffic
FOCS 1998
|
Theoretical Computer Science
|
claim paper
Related Content
»
Strategy Improvement for Concurrent Reachability Games
»
Winning Concurrent Reachability Games Requires DoublyExponential Patience
»
Strategy Improvement for Concurrent Safety Games
»
Expected ReachabilityTime Games
»
Termination Criteria for Solving Concurrent Safety and Reachability Games
»
The complexity of solving reachability games using value and strategy iteration
»
MinimumTime Reachability in Timed Games
»
Concurrent Games with Ordered Objectives
»
Quantitative solution of omegaregular games
more »
Post Info
More Details (n/a)
Added
04 Aug 2010
Updated
04 Aug 2010
Type
Conference
Year
1998
Where
FOCS
Authors
Luca de Alfaro, Thomas A. Henzinger, Orna Kupferman
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision