Note on the Tableau Technique for Commutative Transition Systems
AbstractWe define a class of transition systems called effective commutative transition systems (ECTS) and show, by generalising a tableau-based proof for BPP, that 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 infinite-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.
How to Cite
Srba, J. (2001). Note on the Tableau Technique for Commutative Transition Systems. BRICS Report Series, 8(50). https://doi.org/10.7146/brics.v8i50.21711
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.