DocumentCode
304875
Title
A modal μ-calculus for durational transition systems
Author
Seidl, Helmut
Author_Institution
Trier Univ., Germany
fYear
1996
fDate
27-30 Jul 1996
Firstpage
128
Lastpage
137
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;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 1996. LICS '96. Proceedings., Eleventh Annual IEEE Symposium on
Conference_Location
New Brunswick, NJ
ISSN
1043-6871
Print_ISBN
0-8186-7463-6
Type
conf
DOI
10.1109/LICS.1996.561312
Filename
561312
Link To Document