Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

29

CONCUR
2001
Springer

favoriteEmaildiscussreport

102views Distributed And Parallel Com...» more CONCUR 2001»

On the Power of Labels in Transition Systems

14 years 3 months ago

On the Power of Labels in Transition Systems

Download www.brics.dk

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 satisﬁability 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.

Jirí Srba

Real-time Traffic

CONCUR 2001 | Distributed And Parallel Computing | Petri Nets | Transition Systems | Unlabelled Petri Nets |

claim paper

Related Content

» Comparing the Expressive Power of WellStructured Transition Systems

» Composing Systems While Preserving Probabilities

» Comparing disjunctive modal transition systems with an oneselecting variant

» The Individual and Collective Token Interpretations of Petri Nets

» PDL over Accelerated Labeled Transition Systems

» Hyperfinite Approximations to Labeled Markov Transition Systems

» Multi Labelled Transition Systems A Semantic Framework for Nominal Calculi

» Behaviour model elaboration using partial labelled transition systems

» Uniform Labeled Transition Systems for Nondeterministic Probabilistic and Stochastic Proce...

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	CONCUR
Authors	Jirí Srba

Comments (0)