Graph proof procedure for real time logic

Jung Hong Kao*, Lawrence Joseph Henschen

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The Real Time Logic (RTL) have been successful in specifying and verifying a class of timing requirements in real-time systems. We proposed a graph proof procedure for RTL formulae. First, we represent the RTL formulae in a connection graph like structure. Based on this graph, we have found some useful deduction rules and reduction rules. From some preliminary experiments, we show that our proof procedure is very efficient.

Original languageEnglish (US)
Title of host publicationProceedings of the 4th International Conference on Software Engineering and Knowledge Engineering
PublisherPubl by IEEE
Pages300-306
Number of pages7
ISBN (Print)0818628308
StatePublished - Dec 1 1992
EventProceedings of the 4th International Conference on Software Engineering and Knowledge Engineering - Capri, Italy
Duration: Jun 15 1992Jun 20 1992

Other

OtherProceedings of the 4th International Conference on Software Engineering and Knowledge Engineering
CityCapri, Italy
Period6/15/926/20/92

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint

Dive into the research topics of 'Graph proof procedure for real time logic'. Together they form a unique fingerprint.

Cite this