Note on the Tableau Technique for Commutative Transition Systems

Abstract

We define a class of transition systems called effective commutative transition systems (ECTS) and show, by generalising a tableaubased proof for BPP, that strong bisimilarity between any two states of such a transition system is decidable. It gives a general technique for extending decidability borders of strong bisimilarity for a wide class of in.nite-state transition systems. This is demonstrated for several process formalisms, namely BPP process algebra, lossy BPP processes, BPP systems with interrupt and timed-arc BPP nets.KeywordsModel CheckTransition SystemParallel CompositionLabel Transition SystemProcess AlgebraThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.