Efficient Model Checking for Duration Calculus Based on Branching-Time Approximations

@article{Frnzle2008EfficientMC,
  title={Efficient Model Checking for Duration Calculus Based on Branching-Time Approximations},
  author={Martin Fr{\"a}nzle and Michael R. Hansen},
  journal={2008 Sixth IEEE International Conference on Software Engineering and Formal Methods},
  year={2008},
  pages={63-72}
}
Duration Calculus (abbreviated to DC) is an interval-based, metric-time temporal logic designed for reasoning about embedded real-time systems at a high level of abstraction. But the complexity of model checking any decidable fragment featuring both negation and chop, DC's only modality, is non-elementary and thus impractical. We here investigate a similar approximation as frequently employed in model checking situation-based temporal logics, where linear-time problems are safely approximated… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Logics of Specification Languages, chapter om Duration Calculus, pages 299– 347

  • M. R. Hansen
  • EATCS: Monographs in Theoretical Computer Science…
  • 2008
1 Excerpt

cidability of a hybrid duration calculus

  • Y. Lakhnech Bouajjani, R. Robbana
  • Electronic Notes in Theoretical Computer Science
  • 2007

Duration Calculus — A Formal Approach to Real-Time Systems

  • Zhou Chaochen, M. R. Hansen
  • EACTS: Monographs in Theoretical Computer Science…
  • 2004
2 Excerpts

Specifying and deciding quantified discrete-time duration calculus formulae using DC- VALID

  • P. K. Pandya
  • Tech. report TCS00-PKP-1, Tata Institute of…
  • 2000
1 Excerpt

Similar Papers

Loading similar papers…