Regularity of BPA-systems is decidable

S. Mauw, H. Mulder

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

It is decidable whether a system in Basic Process Algebra (BPA) is regular with respect to bisimulation semantics. Basic operators in BPA are alternative composition, sequential composition and guarded recursion. A system is regular if the interpretations of all process variables defined in the system have finitely many states. We present an effective method to transform a BPA specification into a linear specification whenever possible.
Original languageEnglish
Title of host publicationCONCUR'94 (Proceedings 5th International Conference on Concurrency Theory, Uppsala, Sweden, August 22-25, 1994)
EditorsB. Jonsson, J. Parrow
PublisherSpringer
Pages34-47
ISBN (Print)3-540-58329-7
DOIs
Publication statusPublished - 1994

Publication series

NameLecture Notes in Computer Science
Volume836
ISSN (Print)0302-9743

Fingerprint Dive into the research topics of 'Regularity of BPA-systems is decidable'. Together they form a unique fingerprint.

Cite this