16 search results - page 1 / 4 » On the Computational Complexity of Bisimulation, Redux |
BIRTHDAY
2003
Springer
13 years 9 months ago
2003
Springer
IANDC
2010
13 years 3 months ago
2010
Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong sim...
CSL
2004
Springer
13 years 8 months ago
2004
Springer
It is well known that in an o-minimal hybrid system the continuous and discrete components can be separated, and therefore the problem of finite bisimulation reduces to the same pr...
CONCUR
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. In this paper, we introduce weak bisimulation in the framework of Labeled Concurrent Markov Chains, that is, probabilistic transition systems which exhibit both probabili...
CONCUR
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We propose a polynomial-time decision procedure for hereditary history preserving bisimilarity (hhp-b) on Basic Parallel Processes (BPP). Furthermore, we give a sound and...