Title :
A modal μ-calculus for durational transition systems
Author_Institution :
Trier Univ., Germany
Abstract :
Durational transition systems are finite transition systems where every transition is additionally equipped with a duration. We consider the problem of interpreting μ-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 μ-formulas over ordinary finite transition systems
Keywords :
algorithm theory; computability; finite automata; formal logic; μ-formulas; addition; durational transition systems; finite transition systems; maximum; minimum; modal μ-calculus; sequencing; Automata; Equations; Lattices; Logic; Safety; Upper bound;
Conference_Titel :
Logic in Computer Science, 1996. LICS '96. Proceedings., Eleventh Annual IEEE Symposium on
Conference_Location :
New Brunswick, NJ
Print_ISBN :
0-8186-7463-6
DOI :
10.1109/LICS.1996.561312
