On the Power of Labels in Transition Systems
Keyword(s):
In this paper we discuss the role of labels in transition systems with regard to bisimilarity and model checking problems. We suggest a general reduction from labelled transition systems to unlabelled ones, preserving bisimilarity and satisfiability of mu-calculus formulas. We apply the reduction to the class of transition systems generated by Petri nets and pushdown automata, and obtain several decidability/complexity corollaries for unlabelled systems. Probably the most interesting result is undecidability of strong bisimilarity for unlabelled Petri nets.
1992 ◽
Vol 03
(04)
◽
pp. 443-478
◽
Keyword(s):
2020 ◽
Vol 28
(2)
◽
pp. 644-652
◽
Keyword(s):