Abstract
CSL formulas and path-based reward variables are two ways of specifying performability measures which depend on a sequence of states in a CTMC. We present the new logic pathCSL which combines ideas and advantages of both approaches.
| Original language | English |
|---|---|
| Title of host publication | PMCCS-6 |
| Subtitle of host publication | The Sixth International Workshop on Performability Modeling of Computer and Communication Systems |
| Editors | Andrea Bobbio, Daniel Deavours, Yue Ma |
| Place of Publication | Urbana-Champaign |
| Publisher | University of Illinois at Urbana-Champaign |
| Pages | 19-22 |
| Publication status | Published - 6 Sept 2003 |
| Event | 6th International Workshop on Performability Modeling of Computer and Communication Systems, PMCCS 2003 - Monticello, United States Duration: 6 Sept 2003 → 7 Sept 2003 Conference number: 6 |
Conference
| Conference | 6th International Workshop on Performability Modeling of Computer and Communication Systems, PMCCS 2003 |
|---|---|
| Abbreviated title | PMCCS |
| Country/Territory | United States |
| City | Monticello |
| Period | 6/09/03 → 7/09/03 |
Fingerprint
Dive into the research topics of 'Model Checking pathCSL'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver