38 search results - page 2 / 8 » Non-interleaving bisimulation equivalences on Basic Parallel... |
CONCUR
2009
Springer
14 years 2 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
CSL
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Bisimilarity and weak bisimilarity are canonical notions of equivalence between processes, which are defined co-inductively, but may be approached
GG
2008
Springer
13 years 8 months ago
2008
Springer
Abstract Synchronising Graphs is a system of parallel graph transformation designed for modeling process interaction in a network environment. We propose a theory of context-free s...
CONCUR
1992
Springer
13 years 11 months ago
1992
Springer
ICALP
2005
Springer
14 years 28 days ago
2005
Springer
We introduce a foundational language for modelling applications over global computers whose interconnection structure can be explicitly manipulated. Together with process distribut...