V 2003

Process Rewrite Systems with Weak Finite-State Unit (full version of INFINITY'2003 paper)

KŘETÍNSKÝ, Mojmír; Vojtěch ŘEHÁK and Jan STREJČEK

Basic information

Original name

Process Rewrite Systems with Weak Finite-State Unit (full version of INFINITY'2003 paper)

Edition

Brno, 23 pp. FIMU-RS-2003-05, 2003

Publisher

FI MU

Other information

Language

English

Type of outcome

Research report

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Czech Republic

Confidentiality degree

is not subject to a state or trade secret

Organization unit

Faculty of Informatics

Keywords in English

process rewrite systems; state extension; infinite-state
Changed: 24/5/2006 15:51, prof. RNDr. Mojmír Křetínský, CSc.

Abstract

In the original language

Various classes of infinite-state processes are often specified by rewrite systems. We extend Mayr's Process Rewrite Systems (PRS) by finite-state unit whose transition function satisfies some restrictions inspired by weak finite automata. We classify these models by their expressiveness and show how the hierarchy of new classes (w.r.t. bisimilarity) is related to both PRS hierarchy of Mayr and two other hierarchies of PRS extensions.