512 search results - page 17 / 103 » Automata as Abstractions |
CONCUR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
FSTTCS
2010
Springer
13 years 6 months ago
2010
Springer
a is an abstract framework for the uniform study of different kinds of dynamical systems. An endofunctor F determines both the type of systems (F-coalgebras) and a notion of behav...
AC
2003
Springer
14 years 1 months ago
2003
Springer
This chapter is to provide a tutorial and pointers to results and related work on timed automata with a focus on semantical and algorithmic aspects of verification tools. We prese...
FUIN
2010
13 years 6 months ago
2010
Abstract. Cellular automata have rich computational properties and, at the same time, provide plausible models of physics-like computation. We study decidability issues in the phas...