Ecological study of chalk streams. Lambourn project. Interim report October 1977 to April 1979

Few detailed studies have been made on the ecology of the chalk streams. A complex community of plants and animals is present and much more information is required to achieve an understanding of the requirements and interactions of all the species. It is important that the rivers affected by this scheme should be studied and kept under continued observation so that any effects produced by the scheme can be detected. The report gives a synopsis of work carried out between 1971 and 1979 focusing on the present phase 1978-1979. It assumes some familiarity with the investigations carried out on the River Lambourn during the preceding years. The aims of the present phase of the project may be divided into two broad aspects. The first involves collecting further information in the field and includes three objectives: a continuation of studies on the Lambourn sites at Bagnor; comparative studies on other chalk streams; and a comparative study on a limestone stream. The second involves detailed analyses of data previously collected to document the recovery of the Lambourn from operational pumping and to attempt to develop simple conceptual and predictive models applicable over a wide range of physical and geographical variables. (PDF contains 43 pages

Kleene-Schützenberger and Büchi Theorems for Weighted Timed Automata

In 1994, Alur and Dill introduced timed automata as a simple mathematical model for modelling the behaviour of real-time systems. In this thesis, we extend timed automata with weights. More detailed, we equip both the states and transitions of a timed automaton with weights taken from an appropriate mathematical structure. The weight of a transition determines the weight for taking this transition, and the weight of a state determines the weight for letting time elapse in this state. Since the weight for staying in a state depends on time, this model, called weighted timed automata, has many interesting applications, for instance, in operations research and scheduling. We give characterizations for the behaviours of weighted timed automata in terms of rational expressions and logical formulas. These formalisms are useful for the specification of real-time systems with continuous resource consumption. We further investigate the relation between the behaviours of weighted timed automata and timed automata. Finally, we present important decidability results for weighted timed automata

Multi-weighted Automata Models and Quantitative Logics

Recently, multi-priced timed automata have received much attention for real-time systems. These automata extend priced timed automata by featuring several price parameters. This permits to compute objectives like the optimal ratio between rewards and costs. Arising from the model of timed automata, the multi-weighted setting has also attracted much notice for classical nondeterministic automata. The present thesis develops multi-weighted MSO-logics on finite, infinite and timed words which are expressively equivalent to multi-weighted automata, and studies decision problems for them. In addition, a Nivat-like theorem for weighted timed automata is proved; this theorem establishes a connection between quantitative and qualitative behaviors of timed automata. Moreover, a logical characterization of timed pushdown automata is given

Weighted automata and multi-valued logics over arbitrary bounded lattices

AbstractWe show that L-weighted automata, L-rational series, and L-valued monadic second order logic have the same expressive power, for any bounded lattice L and for finite and infinite words. We also prove that aperiodicity, star-freeness, and L-valued first-order and LTL-definability coincide. This extends classical results of Kleene, Büchi–Elgot–Trakhtenbrot, and others to arbitrary bounded lattices, without any distributivity assumption that is fundamental in the theory of weighted automata over semirings. In fact, we obtain these results for large classes of strong bimonoids which properly contain all bounded lattices

The Equivalence, Unambiguity and Sequentiality Problems of Finitely Ambiguous Max-Plus Tree Automata are Decidable

We show that the equivalence, unambiguity and sequentiality problems are decidable for finitely ambiguous max-plus tree automata