Name
Abstract | ||
|---|---|---|
. This paper develops a temporal process algebra, CSA, forreasoning about distributed systems that involve qualitative timing constraints.It is a conservative extension of Milner's CCS that combinesthe idea of multiple clocks from the algebra PMC with the assumptionof maximal progress familiar from timed process algebras such as TPL.Using a typical class of examples drawn from hardware design, we motivatewhy these features are useful and in some cases necessary for modelingand... |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1007/3-540-63141-0_12 | CONCUR |
Keywords | Field | DocType |
algebraic theory,multiple clocks,process algebra,distributed system | Discrete mathematics,Observational equivalence,Computer science,Theoretical computer science,Bisimulation,Algebraic theory,Conservative extension,Process calculus,Congruence relation,Distributed computing | Conference |
Volume | ISSN | ISBN |
1243 | 0302-9743 | 3-540-63141-0 |
Citations | PageRank | References |
12 | 0.57 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rance Cleaveland | 1 | 2266 | 254.39 |
| Gerald Lüttgen | 2 | 600 | 40.71 |
| Michael Mendler | 3 | 314 | 34.60 |