732 search results - page 20 / 147 » Axiomatising timed automata |
FMSD
2008
13 years 7 months ago
2008
Abstract. This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start...
BMCBI
2004
13 years 7 months ago
2004
Background: The behaviors of cells in metazoans are context dependent, thus large-scale multicellular modeling is often necessary, for which cellular automata are natural candidat...
ICIAP
1999
ACM
13 years 11 months ago
1999
ACM
Real-world tasks often require real-time performances. However, in many practical cases, “just in time” responses are sufficient. This means that a system should be efficien...
IFIPTCS
2000
13 years 11 months ago
2000
The capabilities of alternating cellular automata (ACA) to accept formal languages are investigated. Several notions of alternation in cellular automata have been proposed. Here we...
JCSS
2007
13 years 7 months ago
2007
Automata for unranked trees form a foundation for XML schemas, querying and pattern languages. We study the problem of efficiently minimizing such automata. First, we study unrank...