415 search results - page 11 / 83 » Regular Processes and Timed Automata |
114
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Asynchronous automata are parallel compositions of finitestate processes synchronizing over shared variables. A deep theorem due to Zielonka says that every regular trac...
119
click to vote
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between process...
125
click to vote
CSR
2006
Springer
15 years 7 months ago
2006
Springer
Zielonka's theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure...
127
click to vote
IDEAS
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper we study the problem of deciding whether a regular path query over views in data-integration systems can be re-expressed without recursion. The problem becomes chall...
141
click to vote
FPL
2008
Springer
15 years 5 months ago
2008
Springer
An approach is presented for high throughput matching of regular expressions (regexes) by first converting them into corresponding Non-deterministic Finite Automata (NFAs) which a...