171 search results - page 13 / 35 » On the Power of Tree-Walking Automata |
PDPTA
2010
13 years 7 months ago
2010
Lattice gas cellular automata (LGCA) models provide a relatively fast means of simulating fluid flow and can give both quantitative and qualitative insights into flow patterns aro...
BIRTHDAY
2008
Springer
13 years 11 months ago
2008
Springer
A number of models of computation on trees labeled with symbols from an infinite alphabet is considered. We study closure and decision properties of each of the models and compare ...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
We compare the expressive power of a class of well-structured transition systems that includes relational automata, Petri nets, lossy channel systems, and constrained multiset rewr...
CONCUR
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. In this paper we discuss the role of labels in transition systems with regard to bisimilarity and model checking problems. We suggest a general reduction from labelled tr...
LICS
1998
IEEE
14 years 1 months ago
1998
IEEE
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...