On the Power of Labels in Transition Systems

Abstract. 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 µ-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.

• Type: Conference
• Year: 2001
• Where: CONCUR
• Authors: Jirí Srba
• Keywords: CONCUR 2001, Distributed And Parallel Computing, Petri Nets, Transition Systems, Unlabelled Petri Nets