论文信息 - Deadlocking States in Context-Free Process Algebra

Deadlocking States in Context-Free Process Algebra

Recently the class of BPA (or context-free) processes has been intensively studied and bisimilarity and regularity appeared to be decidable (see (CHS95, BCS95, BCS96)). We extend these processes with a deadlocking state into BPA~ systems. Bosscher has proved that bisim- ilarity and regularity remain decidable (Bos97). We generalise his ap- proach introducing strict and nonstrict version of bisimilarity. We show that the BPA~ class is more expressive w.r.t. (both strict and nonstrict) bisimilarity but it remains language equivalent to BPA. Finally we give a characterization of those BPA~ processes which can be equivalently (up to bisimilarity) described within the 'pure' BPA syntax.

Jirí Srba

[1] Jan A. Bergstra,et al. Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[2] D.J.B. Bosscher,et al. Grammars modulo bisimulation , 1997 .

[3] Faron Moller,et al. Decidability Results in Automata and Process Theory , 1996, Banff Higher Order Workshop.

[4] Faron Moller,et al. Infinite Results , 1996, CONCUR.

[5] Bernhard Steffen,et al. An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes , 1995, MFCS.

[6] J. Srba,et al. Comparing the Classes BPA and BPA with Deadlocks , 1998 .

[7] Hans Hu¨ttel,et al. Decidability, behavioural equivalences and infinite transition graphs , 1991 .

[8] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.

[9] Bernhard Steffen,et al. Bisimulation Collapse and the Process Taxonomy , 1996, CONCUR.

[10] Søren Christensen,et al. Bisimulation Equivalence is Decidable for all Context-Free Processes , 2022 .