3218 search results - page 121 / 644 » Timed Extensions for SDL |
FSTTCS
2005
Springer
15 years 10 months ago
2005
Springer
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...
148
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
We show how to find a normal form proper equilibrium in behavior strategies of a given two-player zero-sum extensive form game with imperfect information but perfect recall. Our a...
138
click to vote
WSCG
2001
15 years 5 months ago
2001
In computer graphics and engineering many classes of complex objects can be designed with L-systems. We present a concept for enhancing timed and parametric L-systems with physics...
156
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Time is one of the most difficult aspects to handle in real world applications such as database systems. Relational database management systems proposed by Codd offer very little ...
132
click to vote
FOSSACS
2006
Springer
15 years 8 months ago
2006
Springer
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan...