Sciweavers

FOSSACS
2006
Springer
13 years 8 months ago
Undecidability Results for Bisimilarity on Prefix Rewrite Systems
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 de...
Petr Jancar, Jirí Srba
CSL
2009
Springer
13 years 11 months ago
Model Checking FO(R) over One-Counter Processes and beyond
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
Anthony Widjaja To