52 search results - page 2 / 11 » Verifying Linear Duration Constraints of Timed Automata |
ASYNC
2005
IEEE
13 years 11 months ago
2005
IEEE
We propose a novel technique for modeling and verifying timed circuits based on the notion of generalized relative timing. Generalized relative timing constraints can express not ...
ZUM
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. We present a new combination CSP-OZ-DC of three well researched formal techniques for the specification of processes, data and time: CSP [17], Object-Z [36], and Duration...
ICTAC
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Regular expressions with numerical constraints are an extension of regular expressions, allowing to bound numerically the number of times that a subexpression should be m...
FORMATS
2006
Springer
13 years 9 months ago
2006
Springer
Timed and weak timed simulation relations are often used to show that operations on hybrid systems result in equivalent behavior or in conservative overapproximations. Given that s...
GW
2005
Springer
13 years 10 months ago
2005
Springer
Simulating realistic human-like figures is still a challenging task when dynamics is involved. For example, making a virtual human jump to a given position requires to control the...