423 search results - page 45 / 85 » The Generalization of Generalized Automata: Expression Autom... |
141
click to vote
FAC
2008
15 years 3 months ago
2008
Given deterministic interfaces P and Q, we investigate the problem of synthesising an interface R such that P composed with R refines Q. We show that a solution exists iff P and Q ...
144
click to vote
PODC
1999
ACM
15 years 8 months ago
1999
ACM
We present a new approach for reasoning about liveness properties of distributed systems, represented as automata. Our approach is based on simulation relations, and requires reas...
137
click to vote
JUCS
2010
15 years 2 months ago
2010
Abstract: We study the number of matching substrings in the pattern matching problem. In general, there can be a quadratic number of matching substrings in the size of a given text...
158
click to vote
CMSB
2007
Springer
15 years 10 months ago
2007
Springer
For modeling and analyzing regulatory networks based on qualitative information and possibly additional temporal constraints, approaches using hybrid automata can be very helpful. ...
131
click to vote
WIA
2007
Springer
15 years 10 months ago
2007
Springer
We study the pattern statistics representing the number of occurrences of a given string in a word of length n generated at random by rational stochastic models, defined by means ...