Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for t...
Rajeev Alur, Robert P. Kurshan, Mahesh Viswanathan
In this paper we consider parity games defined by higher-order pushdown automata. These automata generalise pushdown automata by the use of higher-order stacks, which are nested ...
Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H...
Many probabilistic models for natural language are now written in terms of hierarchical tree structure. Tree-based modeling still lacks many of the standard tools taken for grante...
Model checking is a method for the verification of systems with respect to their specifications. Symbolic model-checking, which enables the verification of large systems, procee...
Armstrong databases are a popular tool in example-based database design. An Armstrong database for a given constraint set from a fixed constraint class Z satisfies precisely those ...