## Paper: A Modal Mu-Calculus for Durational Transition Systems (at LICS 1996)

**Helmut Seidl**

### Abstract

Durational transition systems are finite transition systems where every transition is additionally equipped with a duration. We consider the problem of interpreting $\mu$--formulas over durational transition systems. In case the formula contains only operations minimum, maximum, addition, and sequencing, we show that the interpretation ist not only computable but (up to a linear factor) as efficiently computable as the interpretation of $\mu$--formulas over ordinary finite transition systems.

### BibTeX

@InProceedings{Seidl-AModalMuCalculusfor, author = {Helmut Seidl}, title = {A Modal Mu-Calculus for Durational Transition Systems}, booktitle = {Proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science (LICS 1996)}, year = {1996}, month = {July}, pages = {128--137}, location = {New Brunswick, NJ, USA}, publisher = {IEEE Computer Society Press} }