Informace o publikaci

Note on the Tableau Technique for Commutative Transition Systems

Logo poskytovatele
Autoři

SRBA Jiří

Rok publikování 2002
Druh Článek ve sborníku
Konference Proceedings of 5th Foundations of Software Science and Computation Structures (FOSSACS'02)
Fakulta / Pracoviště MU

Fakulta informatiky

Citace
Obor Teorie informace
Klíčová slova bisimilarity checking; infinite systems; tableau
Popis We define a class of transition systems called effective commutative transition systems (ECTS) and show, by generalising a tableau-based 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 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.
Související projekty:

Používáte starou verzi internetového prohlížeče. Doporučujeme aktualizovat Váš prohlížeč na nejnovější verzi.

Další info