415 search results - page 18 / 83 » Regular Processes and Timed Automata |
WSC
2007
13 years 11 months ago
2007
The simulation of group-work interaction is significant for Chinese enterprise organizational management. As a result, a cellular-automata based simulation model is put forward. T...
DOCENG
2003
ACM
14 years 2 months ago
2003
ACM
By exploiting the theories of automata and graphs, we propose algorithms and a process for editing valid XML documents [4][5]. The editing process avoids syntactic violations alto...
FSTTCS
2010
Springer
13 years 6 months ago
2010
Springer
Quantitative properties of timed regular languages, such as information content (growth rate, entropy) are explored. The approach suggested by the same authors is extended to lang...
JCSS
2008
13 years 8 months ago
2008
A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply ...
IMECS
2007
13 years 10 months ago
2007
— ACPsrt hs is a hybrid process algebra obtained by extending a combination of two existing extensions of Algebra of Communicating Processes (ACP), namely the process algebra wit...