732 search results - page 6 / 147 » Axiomatising timed automata |
IJCSA
2007
13 years 7 months ago
2007
Timed Concurrent State Machines are an application of Alur’s Timed Automata concept to coincidence-based (rather than interleaving) CSM modeling technique. TCSM support the idea...
JUCS
2010
13 years 6 months ago
2010
: The membership problems of both stack automata and nonerasing stack automata are shown to be complete for polynomial time.
FORMATS
2003
Springer
14 years 21 days ago
2003
Springer
In this paper we report some progress in applying timed automata technology to large-scale problems. We focus on the problem of finding maximal stabilization time for combinationa...
FSEN
2009
Springer
13 years 11 months ago
2009
Springer
This note aims at providing a concise and precise Travellers Guide, Phrase Book or Reference Manual to the timed automata modeling formalism introduced by Alur and Dill [7, 8]. The...
ICFEM
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. On the one hand, modal specifications are classic, convenient, and expressive mathematical objects to represent interfaces of component-based systems. On the other hand, ...