512 search results - page 51 / 103 » Automata as Abstractions |
AIIA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. When dealing with real systems, it is unrealistic to suppose that observations can be totally ordered according to their emission dates. The partially ordered observation...
ATVA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
SBRN
2000
IEEE
14 years 1 months ago
2000
IEEE
d Articles >> Table of Contents >> Abstract VI Brazilian Symposium on Neural Networks (SBRN'00) p. 24 Adaptation of Parameters of BP Algorithm Using Automata Hamid...
CSR
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. While visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages, the complexity of their members...
ACRI
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. Network decontamination (or disinfection) is a widely studied problem in distributed computing. Network sites are assumed to be contaminated (e.g., by a virus) and a team...