In modern day road traffic management, government officials are supported by software to store and visualize traffic signs and their underlying legal intentions (so-called traffic measures) on top of digital street maps. To date, however, methods are missing that help to ensure the correctness of traffic regulations. Driven by the vision of Smart Cities, this lack of tools is becoming increasin...

Undecidability of various properties of first order term rewriting systems is well-known. An undecidable property can be classified by the complexity of the formula defining it. This gives rise to a hierarchy of distinct levels of undecidability, starting from the arithmetical hierarchy classifying properties using first order arithmetical formulas and continuing into the analytic hierarchy, wh...

We present a new proof of Chew's theorem, which states that normal forms are unique up to conversion in compatible term rewriting systems. We apply the technique of left-right separated conditional term rewriting systems (LRCTRSs), in which the unique normal form property of a term rewriting system is reduced to the Church-Rosser property of its conditional linearization. In contrast to traditi...

In 1977 Mazurkiewicz [14] proposed free partially commutative monoids as a tool for describing behaviour of concurrent systems. In this approach one represents elementary actions with letters of a given alphabet; then an observation of a finite run of a system is just a word over the alphabet. Two words are regarded as describing the same behaviour whenever they can be obtained from each other ...

Title of Thesis: TRAFFIC SIGNAL TIMING FOR URBAN EVACUATION Ming Chen, Master of Science, 2005 Directed By: Dr. Elise Miller-Hooks Department of Civil Engineering Significant effort has been expended to reduce the evacuation time in a geographic evacuation. The majority of these efforts have focused on freeways and it appears that there has been no systematic consideration of signal timing in e...

reduction systems (ARS) are abstract structures for studying general properties of rewriting systems. An ARS is just a set equipped with a set of binary relations. Despite this generality many aspects of rewriting systems can be approached in the theory of ARS, such as confluence and normalization. Moreover, important results have been stated and proved in this setting (examples are Newman’s le...

The Abstract State Machine Thesis asserts that every classical algorithm is behaviorally equivalent to an abstract state machine. This thesis has been shown to follow from three natural postulates about algorithmic computation. Here, we prove that augmenting those postulates with an additional requirement regarding basic operations implies Church’s Thesis, namely, that the only numeric function...