1413 search results - page 3 / 283 » Bisimilarity of Open Terms |
FOSSACS
2006
Springer
13 years 9 months ago
2006
Springer
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...
ESOP
2009
Springer
14 years 16 days ago
2009
Springer
The operational semantics of interactive systems is usually d by labeled transition systems. Abstract semantics is defined in terms of bisimilarity that, in the finite case, can ...
ENTCS
2006
13 years 5 months ago
2006
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (...
CALCO
2009
Springer
14 years 10 days ago
2009
Springer
The operational semantics of interactive systems is usually described by labeled transition systems. Abstract semantics (that is defined in terms of bisimilarity) is characterized...
ESOP
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. The concurrent constraint pi-calculus (cc-pi-calculus) has been introduced as a model for concluding Service Level Agreements. The cc-pi calculus combines the synchronous...