3750 search results - page 44 / 750 » Timed Automata Patterns |
147
click to vote
FUIN
2008
15 years 6 months ago
2008
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...
147
click to vote
ICANN
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We investigate the computational capabilities of probabilistic cellular automata by means of the density classification problem. We find that a specific probabilistic ...
183
click to vote
CORR
2011
Springer
15 years 29 days ago
2011
Springer
—We present a method to eliminate redundancy in the transition tables of Boolean automata: schema redescription with two symbols. One symbol is used to capture redundancy of indi...
146
click to vote
FSTTCS
2007
Springer
16 years 4 days ago
2007
Springer
Abstract. We provide a framework for distributed systems that impose timing constraints on their executions. We propose a timed model of communicating finite-state machines, which...
160
click to vote
ATVA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Priorities are often used to resolve conflicts in timed systems. However, priorities are not directly supported by state-of-art model checkers. Often, a designer has to ...