15 search results - page 3 / 3 » Decidability of Bisimulation Equivalence for Processes Gener... |
FSTTCS
2010
Springer
13 years 4 months ago
2010
Springer
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5 ), thus improving...
ICALP
1999
Springer
13 years 10 months ago
1999
Springer
We consider the problem of simulation preorder/equivalence between infinite-state processes and finite-state ones. We prove that simulation preorder (in both directions) and simu...
APLAS
2009
ACM
14 years 23 days ago
2009
ACM
We define a higher-order process calculus with algebraic operations such as encryption and decryption, and develop a bisimulation proof method for behavioral equivalence in this c...
LICS
2012
IEEE
11 years 8 months ago
2012
IEEE
—This paper introduces HOpiPn, the higher-order pi-calculus with passivation and name creation, and develops an equivalence theory for this calculus. Passivation [Schmitt and Ste...
DOOD
1995
Springer
13 years 9 months ago
1995
Springer
Wrappers provide access to heterogeneous information sources by converting application queries into source speci c queries or commands. In this paper we present a wrapper implemen...