Automata representations for Concurrent METATEM

Concurrent METATEM is a language based on the execution of temporal logic formulae. The current implementations are based upon direct interpretation, yet are too slow for large applications. We present an approach to implementing the language by representing temporal formulae as finite-state automata. To combat the problems associated with constructing a single automaton containing all possible models of a formula, we partition the representation into three closely coupled automata. This provides structures small enough to be effectively used for larger applications, while still allowing increased performance over the direct interpretation of temporal formulae.