Abstract
This paper raises the question on how to specify timeouts in process algebra, and finds that the basic formalisms fall short in this task.
Original language | English |
---|---|
Pages (from-to) | 173-175 |
Number of pages | 3 |
Journal | Electronic Notes in Theoretical Computer Science |
Volume | 162 |
DOIs | |
Publication status | Published - 29 Sept 2006 |
Keywords / Materials (for Non-textual outputs)
- Concurrency
- Process Algebra
- Liveness
- Fairness
- Timeouts
- Priorities
- Petri nets