38 search results - page 2 / 8 » Non-interleaving bisimulation equivalences on Basic Parallel... |
125
click to vote
CONCUR
2009
Springer
15 years 8 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...
95
Voted
CSL
2006
Springer
15 years 5 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
100
click to vote
GG
2008
Springer
15 years 2 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
15 years 6 months ago
1992
Springer
109
Voted
ICALP
2005
Springer
15 years 7 months 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...