Queues as Processes
Olaf Burkart · Electronic Notes in Theoretical Computer Science · 1998
Rewrite systems have successfully been used for the description of infinite-state systems. According to the interpretation of words as either sequences or multisets rewrite systems may describe classes of transition systems like e.g. BPA, PDA, BPP or Petri Nets. In this paper we introduce a new hierarchy of processes obtained by considering rewrite systems together with a FIFO-like rewrite rule. We investigate the reachability, bisimulation and model checking problems for these processes.