423 search results - page 29 / 85 » The Generalization of Generalized Automata: Expression Autom... |
CAV
2006
Springer
14 years 13 days ago
2006
Springer
Fast is a tool designed for the analysis of counter systems, i.e. automata extended with unbounded integer variables. Despite the reachability set is not recursive in general, Fast...
JLP
2010
13 years 3 months ago
2010
We present a general framework for the analysis of quantitative and qualitative properties of reactive systems, based on a notion of weighted transition systems. We introduce and ...
ANCS
2006
ACM
14 years 2 months ago
2006
ACM
Modern deep packet inspection systems use regular expressions to define various patterns of interest in network data streams. Deterministic Finite Automata (DFA) are commonly used...
ITICSE
2004
ACM
14 years 2 months ago
2004
ACM
The use of generic and generative methods for the development and application of interactive educational software is a relatively unexplored area in industry and education. Advant...
TACAS
2010
Springer
14 years 3 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...