Sciweavers

415 search results - page 5 / 83
» Regular Processes and Timed Automata
Sort
View
CONCUR
2010
Springer
13 years 10 months ago
Kleene, Rabin, and Scott Are Available
We are concerned with the availability of systems, defined as the ratio between time of correct functioning and uptime. We propose to model guaranteed availability in terms of regu...
Jochen Hoenicke, Roland Meyer, Ernst-Rüdiger ...
CPM
2005
Springer
105views Combinatorics» more  CPM 2005»
14 years 3 months ago
Reducing the Size of NFAs by Using Equivalences and Preorders
Abstract. The efficiency of regular expression matching algorithms depends very much on the size of the nondeterministic finite automata (NFA) obtained from regular expressions. R...
Lucian Ilie, Roberto Solis-Oba, Sheng Yu
ISOLA
2004
Springer
14 years 3 months ago
Embedding Finite Automata within regular Expressions
Abstract. Regular expressions and their extensions have become a major component of industry-standard specification languages such as PSL/Sugar ([2]). The model checking procedure...
Shoham Ben-David, Dana Fisman, Sitvanit Ruah
VMCAI
2010
Springer
14 years 4 months ago
Regular Linear Temporal Logic with Past
This paper upgrades Regular Linear Temporal Logic (RLTL) with past operators and complementation. RLTL is a temporal logic that extends the expressive power of linear temporal logi...
César Sánchez, Martin Leucker
ALIFE
1999
13 years 9 months ago
A New Structurally Dissolvable Self-Reproducing Loop Evolving in a Simple Cellular Automata Space
tion, structural dissolutionAbstract We constructed a simple evolutionary system, "evoloop," on a deterministic nine-state five-neighbor cellular automata (CA) space by i...
Hiroki Sayama