Sciweavers

64 search results - page 13 / 13
» Real-Counter Automata and Their Decision Problems
Sort
View
111
Voted
CONCUR
2001
Springer
15 years 5 months ago
Symbolic Computation of Maximal Probabilistic Reachability
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
97
Voted
LICS
2007
IEEE
15 years 6 months ago
The Cost of Punctuality
In an influential paper titled “The Benefits of Relaxing Punctuality” [2], Alur, Feder, and Henzinger introduced Metric Interval Temporal Logic (MITL) as a fragment of the r...
Patricia Bouyer, Nicolas Markey, Joël Ouaknin...
96
Voted
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
16 years 27 days ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
103
Voted
CASES
2006
ACM
15 years 6 months ago
Extensible control architectures
Architectural advances of modern systems has often been at odds with control complexity, requiring significant effort in both design and verification. This is particularly true ...
Greg Hoover, Forrest Brewer, Timothy Sherwood