A Fast, Partially Parallelizable Algorithm for Predicting Execution Time of EQL Rule-Based Programs
Real-time expert systems are embedded decision systems which must respond to changes in the environments within stringent timing constraints. A major problem impeding the use of rule-based expert systems in real-time environments is the difficulty in predicting the response time of these rule-based...
Uloženo v:
| Vydáno v: | 1994 International Conference on Parallel Processing Vol. 3 Ročník 3; s. 17 - 20 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
1994
|
| Témata: | |
| ISBN: | 0849324939, 9780849324932 |
| ISSN: | 0190-3918 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | Real-time expert systems are embedded decision systems which must respond to changes in the environments within stringent timing constraints. A major problem impeding the use of rule-based expert systems in real-time environments is the difficulty in predicting the response time of these rule-based systems. In this paper, we tackle this problem with a fast, partially parallelizable response time analysis algorithm for a class of EQL rule-based programs with constant assignments in the action parts of the rules. |
|---|---|
| ISBN: | 0849324939 9780849324932 |
| ISSN: | 0190-3918 |
| DOI: | 10.1109/ICPP.1994.24 |

