Concurrent turing machines

Berndt Farwer*, Manfred Kudlek, Heiko Roelke

*Corresponding author for this work

    Research output: Contribution to journalArticlepeer-review


    We define Concurrent Turing Machines (CTMs) as Turing machines with Petri nets as finite control. This leads to machines with arbitrary many tape heads, thus subsuming any class of (constant) k-head Turing machines. Space, time, and head complexity classes are introduced and discussed showing the difference of various acceptance conditions that are defined for CTMs. Nevertheless, we show that CTMs can be simulated by TMs.

    Concurrent Turing machines correspond to a class of multiset rewriting systems. The definition of a CTMs as a rewrite theory avoids the need for encoding multisets as words and using an equivalence relation on configurations. Multiset rewriting lends itself to be used in rewriting systems and tools like the rewriting engine Maude. For the rewriting system, a configuration is given by a varying sequence of strings and multisets.

    Original languageEnglish
    Pages (from-to)303-317
    Number of pages15
    JournalFundamenta Informaticae
    Issue number3-4
    Publication statusPublished - 2007
    EventWorkshop on the Concurrency Specification and Programming (CS&P) - Wandlitz, Gambia
    Duration: 27 Sept 200629 Sept 2006


    Dive into the research topics of 'Concurrent turing machines'. Together they form a unique fingerprint.

    Cite this