Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Quantitative temporal reasoning
Real-Time Systems
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Handbook of logic in computer science (vol. 2)
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Theoretical Computer Science
Symbolic model checking for real-time systems
Information and Computation
Translations between modal logics of reactive systems
AMAST '93 Selected papers of the international conference on Algebraic methodology of software technology
A theory of processes with durational actions
AMAST '93 Selected papers of the international conference on Algebraic methodology of software technology
Integer Constraints to Stop Deforestation
ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
Least Solutions of Equations over N
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
A Hierarchy of Temporal Logics with Past (Extended Abstract)
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Faster Model Checking for the Modal Mu-Calculus
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
On Model-Checking for Fragments of µ-Calculus
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract)
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
An Improved Algorithm for the Evaluation of Fixpoint Expressions
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Real-Time and the Mu-Calculus (Preliminary Report)
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Quantitative μ-calculus and CTL defined over constraint semirings
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
Quantitative μ-calculus and CTL Based on Constraint Semirings
Electronic Notes in Theoretical Computer Science (ENTCS)
Computing game values for crash games
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
| Hi-index | 0.00 |
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.