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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J.C.M. Baeten, J.A. Bergstra & J.W. Klop, Decidability of bisimulation equivalence for processes generating context-free languages, Proc. PARLE 87, (J.W. de Bakker, A.J. Nijman, P.C. Treleaven, Eds.), LNCS 259, pp. 93–114, 1987.
J.C.M. Baeten & W.P. Weijland, Process algebra, Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press, 1990.
J.A. Bergstra & J.W. Klop, Process theory based on bisimulation semantics, Linear time, branching time and partial order in logics and models for concurrency, (J.W. de Bakker, W.P. de Roever, G. Rozenberg, Eds.), LNCS 354, pp. 50–122, 1989.
S. Christensen, H. Hüttel & C. Stirling, Bisimulation equivalence is decidable for all context-free processes, Proc. CONCUR’92, (W.R. Cleaveland, ed.), LNCS 630, pp. 138–147, 1992.
S. Christensen, Y. Hirschfeld & F. Moller, Bisimulation equivalence is decidable for basic parallel processes, Proc. CONCUR’93, (E. Best, ed.), LNCS 715, pp. 143–157, 1993.
S. Mauw & G.J. Veltink, A process specification formalism, Fundamenta Informaticw XIII, pp. 85–139, 1990.
S. Mauw & G.J. Veltink, Algebraic specification of communication protocols, Cambridge Tracts in Theoretical Computer Science 36, Cambridge University Press, 1993.
R. Milner, A complete inference system for a class of regular behaviours, JCSS 28, pp. 439–466, 1984.
D.M.R. Park, Concurrency and automata on infinite sequences, Proc. 5th GI Conf. (P. Duessen, ed.), LNCS 104, pp. 167–183, 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mauw, S., Mulder, H. (1994). Regularity of BPA-Systems is Decidable. In: Jonsson, B., Parrow, J. (eds) CONCUR ’94: Concurrency Theory. CONCUR 1994. Lecture Notes in Computer Science, vol 836. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48654-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-48654-1_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58329-5
Online ISBN: 978-3-540-48654-1
eBook Packages: Springer Book Archive