49 search results - page 9 / 10 » Clearing Restarting Automata |
IEEESCC
2005
IEEE
13 years 12 months ago
2005
IEEE
Web service discovery is a key problem as the number of services is expected to increase dramatically. Service discovery at the present time is based primarily on keywords, or int...
CAV
2005
Springer
13 years 11 months ago
2005
Springer
In this work we study hybrid approaches to LTL symbolic model checking; that is, approaches that use explicit representations of the property automaton, whose state space is often ...
SDL
2001
13 years 7 months ago
2001
In this paper we propose some extensions necessary to enable the speci cation and description language SDL to become an appropriate formalism for the design of real-time and embedd...
AAAI
1990
13 years 7 months ago
1990
Cyclic definitions are often prohibited in terminological knowledge representation languages because, from a theoretical point of view, their semantics is not clear and, from a pr...
FORMATS
2010
Springer
13 years 4 months ago
2010
Springer
We present a general approach to combine symbolic state space representations for the discrete and continuous parts in the synthesis of winning strategies for timed reachability ga...