27 search results - page 1 / 6 » Strong Splitting Bisimulation Equivalence |
CALCO
2005
Springer
13 years 10 months ago
2005
Springer
We present ACPc , a process algebra with conditional expressions in which the conditions are taken from a Boolean algebra, and extensions of this process algebra with mechanisms fo...
ICALP
1998
Springer
13 years 9 months ago
1998
Springer
BIRTHDAY
2003
Springer
13 years 10 months ago
2003
Springer
Equivalence between designs is a fundamental notion in verification. The linear and branching approaches to verification induce different notions of equivalence. When the designs...
CONCUR
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. In this paper, we provide a transformation from the branching bisimulation problem for infinite, concurrent, data-intensive systems in linear process format, into solving...
TCS
2008
13 years 4 months ago
2008
We show that the class of Petri nets is less expressive with respect to bisimulation equivalence than the class of PA processes extended with a finite state control unit. Key word...