Sciweavers

81
Voted
FORTE
2008
15 years 11 days ago
Parameterized Tree Systems
Abstract. Several recent works have considered parameterized verification, i.e. automatic verification of systems consisting of an arbitrary number of finite-state processes organi...
Parosh Aziz Abdulla, Noomene Ben Henda, Giorgio De...
78
Voted
ICALP
2000
Springer
15 years 2 months ago
Efficient Verification Algorithms for One-Counter Processes
We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between process...
Antonín Kucera