On Specifying Timeouts

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Pages (from-to)173-175
Number of pages3
JournalElectronic Notes in Theoretical Computer Science
Volume162
DOIs
Publication statusPublished - 29 Sept 2006

Keywords / Materials (for Non-textual outputs)

  • Concurrency
  • Process Algebra
  • Liveness
  • Fairness
  • Timeouts
  • Priorities
  • Petri nets

Fingerprint

Dive into the research topics of 'On Specifying Timeouts'. Together they form a unique fingerprint.

Cite this