Name
Abstract | ||
|---|---|---|
In this paper we show how certain types of schedulers can be specified using the modal-mu calculus. We specify processes in CCS and show that scheduled processes satisfy the behavioural constraints imposed by the schedulers. We use simple examples and the CWB to demonstrate how automatic verification of systems can be carried out. |
Year | Venue | Keywords |
|---|---|---|
1994 | AUSTRALIAN COMPUTER JOURNAL | AUTOMATIC VERIFICATION,SCHEDULERS,CONCURRENCY |
DocType | Volume | Issue |
Journal | 26 | 2 |
ISSN | Citations | PageRank |
0004-8917 | 0 | 0.34 |
References | Authors | |
0 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Krishnan Padmanabhan | 1 | 305 | 33.55 |