Sciweavers

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

10

FOSSACS
2006
Springer

favoriteEmaildiscussreport

106views Software Engineering» more FOSSACS 2006»

Undecidability Results for Bisimilarity on Prefix Rewrite Systems

13 years 8 months ago

Undecidability Results for Bisimilarity on Prefix Rewrite Systems

Download www.cs.vsb.cz

Abstract. We answer an open question related to bisimilarity checking on labelled transition systems generated by prefix rewrite rules on words. Stirling (1996, 1998) proved the decidability of bisimilarity for normed pushdown processes. This result was substantially extended by S

Petr Jancar, Jirí Srba

Real-time Traffic

FOSSACS 2006 | Prefix Rewrite Rules | Pushdown Processes | Software Engineering | Type -1 Systems |

claim paper

Related Content

» On characterising strong bisimilarity in a fragment of CCS with replication

» Primitive Rewriting

» On the Power of Labels in Transition Systems

» On Bisimilarity and Substitution in Presence of Replication

» Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems

» On Decidability of LTL Model Checking for Process Rewrite Systems

» Reachability in Unions of Commutative Rewriting Systems Is Decidable

» Decidability Results for Restricted Models of Petri Nets with Name Creation and Replicatio...

» Reachability Problems on Regular Ground Tree Rewriting Graphs

Post Info
More Details (n/a)

Added	22 Aug 2010
Updated	22 Aug 2010
Type	Conference
Year	2006
Where	FOSSACS
Authors	Petr Jancar, Jirí Srba

Comments (0)