19 search results - page 1 / 4 » Checking Equivalences Between Concurrent Systems of Finite A... |
ICALP
1992
Springer
13 years 8 months ago
1992
Springer
APLAS
2007
ACM
13 years 8 months ago
2007
ACM
: An Extended Abstract Alwen Tiu Computer Sciences Laboratory Australian National University Abstract. A notion of open bisimulation is formulated for the spi calculus, an extensio...
TABLEAUX
1998
Springer
13 years 8 months ago
1998
Springer
ple (Extended Abstract) Edmund M. Clarke and Sergey Berezin Carnegie Mellon University -- USA Model checking is an automatic verification technique for finite state concurrent syst...
ICALP
1998
Springer
13 years 9 months ago
1998
Springer
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
FOSSACS
2000
Springer
13 years 8 months ago
2000
Springer
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...