Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{403375,
author = {Srba, Jiří},
address = {Holland},
booktitle = {Proceedings of 5th Foundations of Software Science and Computation Structures (FOSSACS'02)},
keywords = {bisimilarity checking; infinite systems; tableau},
language = {eng},
location = {Holland},
pages = {387-401},
publisher = {Springer-Verlag},
title = {Note on the Tableau Technique for Commutative Transition Systems},
year = {2002}
}
TY - JOUR
ID - 403375
AU - Srba, Jiří
PY - 2002
TI - Note on the Tableau Technique for Commutative Transition Systems
PB - Springer-Verlag
CY - Holland
KW - bisimilarity checking
KW - infinite systems
KW - tableau
N2 - 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.
ER -
SRBA, Jiří. Note on the Tableau Technique for Commutative Transition Systems. Online. In \textit{Proceedings of 5th Foundations of Software Science and Computation Structures (FOSSACS'02)}. Holland: Springer-Verlag, 2002. s.~387-401. [citováno 2024-04-23]
|
