227 search results - page 6 / 46 » P Systems and Finite Automata |
106
click to vote
TACAS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We present a general theory that exploits simulation relations on transition systems to obtain antichain algorithms for solving the reachability and repeated reachability...
104
click to vote
IMCSIT
2010
15 years 2 months ago
2010
Abstract--There are numerous formats for writing spellcheckers for open-source systems and there are many descriptions for languages written in these formats. Similarly, for word h...
157
click to vote
DEBS
2009
ACM
15 years 11 months ago
2009
ACM
Efficient matching of incoming events to persistent queries is fundamental to event pattern matching, complex event processing, and publish/subscribe systems. Recent processing e...
103
click to vote
FUIN
2008
15 years 4 months ago
2008
Abstract. Communicating Hierarchical Transaction-based Timed Automata have been introduced to model systems performing long
121
click to vote
IJFCS
2008
15 years 4 months ago
2008
We consider the problem of synchronizing the activity of all the membranes of a P system. After pointing at the connection with a similar problem dealt with in the field of cellul...