We present a set of reduction rules for LTL model-checking of 1-safe Petri nets. Our reduction techniques are of two kinds: (1) Linear programming techniques which are based on wel...
Abstract. We extend the termination proof methods based on reduction orderings to higher-order rewriting systems `a la Nipkow using higher-order pattern matching for firing rules,...
We dene a perpetual one-step reduction strategy which enables one to construct minimal (w.r.t. Levy's ordering 2 on reductions) innite reductions in Conditional Orthogonal ...
A reduction system for regular expressions is presented. For a regular expression t, the reduction system is proved to terminate in a state where the most-reduced expression readil...
Abstract— In this paper we present a dual-based decomposition method, called here the proximal center method, to solve distributed model predictive control (MPC) problems for cou...