FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2108481891> ?p ?o ?g. }

• W2108481891 endingPage "1653" @default.
• W2108481891 startingPage "1640" @default.
• W2108481891 abstract "Embedded and real-time systems are increasingly common and complex, requiring formal specification and verification in order to guarantee their satisfaction of desirable safety and timing requirements. Real-Time Logic (RTL) has been used to capture both the specification (denoted by SP) of a real-time system and the desirable safety assertions (denoted by SA) with respect to this system specification. A verification procedure then determines whether the safety assertions hold with respect to the system specification. However, the satisfiability problem for RTL (i.e., Can SP rightarrow SA hold?”), as well as for other first order logics, is undecidable. Consequently, efforts have been focused on identifying nontrivial classes of formulas sufficiently practical for describing industrial real-time systems for which the verification and debugging can be done via efficient heuristics. One such class of formulas is the so-called path RTL. The first contribution of this paper is to extend the existing path RTL class without sacrificing the time complexity of the traditional path RTL heuristic for verification. This implies that we can specify and verify real-time systems, which we were unable to do using the existing path RTL, in the extended path RTL. For real-time systems with large specifications, there is a lot of room for improvement in the algorithms used for verification and debugging. The second contribution of this paper is an efficient method to perform verification and debugging of real-time systems specifications using decomposition techniques. Our idea is to decompose the constraint graph, used in existing approaches, into independent subgraphs so that it is no longer necessary to analyze the entire specification at once, but rather its individual and smaller components. However, none of the above heuristics necessarily finds an “optimal implication.” After verifying SP rightarrow SA and deploying the system implementing SP, performance changes as a result of power saving, faulty components, and cost saving in the processing platform for the tasks specified in SP affect the computation times of the specified tasks. This leads to a different but related SP, which would violate the original SP rightarrow SA theorem if SA remains the same. It is desirable, therefore, to determine an optimal SP with the slowest possible computation times for its tasks such that the SA is still guaranteed. This is clearly a fundamental issue in the design and implementation of highly dependable real-time/embedded systems. The third contribution of this paper tackles this fundamental issue by describing a new method for relaxing SP and tightening SA such that SP rightarrow SA is still a theorem. We have implemented this method in the Java-based DEVO-RTL tool and tested it on several industrial real-time systems. Experimental results show that only about 10 percent of the running time of the heuristic for the verification of SP rightarrow SA is needed to find an optimal theorem." @default.
• W2108481891 created "2016-06-24" @default.
• W2108481891 creator A5001205166 @default.
• W2108481891 creator A5055377327 @default.
• W2108481891 date "2009-12-01" @default.
• W2108481891 modified "2023-10-17" @default.
• W2108481891 title "Efficient Verification and Optimization of Real-Time Logic-Specified Systems" @default.
• W2108481891 cites W1491716768 @default.
• W2108481891 cites W1508190831 @default.
• W2108481891 cites W1553574558 @default.
• W2108481891 cites W1554172403 @default.
• W2108481891 cites W1565099081 @default.
• W2108481891 cites W1977439654 @default.
• W2108481891 cites W1985455450 @default.
• W2108481891 cites W1993906925 @default.
• W2108481891 cites W1998165968 @default.
• W2108481891 cites W2006991621 @default.
• W2108481891 cites W2038995301 @default.
• W2108481891 cites W2053928192 @default.
• W2108481891 cites W2056359803 @default.
• W2108481891 cites W2080629401 @default.
• W2108481891 cites W2089029647 @default.
• W2108481891 cites W2104319554 @default.
• W2108481891 cites W2112364980 @default.
• W2108481891 cites W2120150877 @default.
• W2108481891 cites W2121784623 @default.
• W2108481891 cites W2130808014 @default.
• W2108481891 cites W2143070593 @default.
• W2108481891 cites W2155791623 @default.
• W2108481891 doi "https://doi.org/10.1109/tc.2009.79" @default.
• W2108481891 hasPublicationYear "2009" @default.
• W2108481891 type Work @default.
• W2108481891 sameAs 2108481891 @default.
• W2108481891 citedByCount "7" @default.
• W2108481891 countsByYear W21084818912013 @default.
• W2108481891 countsByYear W21084818912015 @default.
• W2108481891 countsByYear W21084818912016 @default.
• W2108481891 crossrefType "journal-article" @default.
• W2108481891 hasAuthorship W2108481891A5001205166 @default.
• W2108481891 hasAuthorship W2108481891A5055377327 @default.
• W2108481891 hasConcept C110251889 @default.
• W2108481891 hasConcept C111498074 @default.
• W2108481891 hasConcept C111919701 @default.
• W2108481891 hasConcept C127705205 @default.
• W2108481891 hasConcept C153269930 @default.
• W2108481891 hasConcept C168065819 @default.
• W2108481891 hasConcept C168773769 @default.
• W2108481891 hasConcept C192034797 @default.
• W2108481891 hasConcept C199360897 @default.
• W2108481891 hasConcept C202973057 @default.
• W2108481891 hasConcept C25016198 @default.
• W2108481891 hasConcept C41008148 @default.
• W2108481891 hasConcept C80444323 @default.
• W2108481891 hasConceptScore W2108481891C110251889 @default.
• W2108481891 hasConceptScore W2108481891C111498074 @default.
• W2108481891 hasConceptScore W2108481891C111919701 @default.
• W2108481891 hasConceptScore W2108481891C127705205 @default.
• W2108481891 hasConceptScore W2108481891C153269930 @default.
• W2108481891 hasConceptScore W2108481891C168065819 @default.
• W2108481891 hasConceptScore W2108481891C168773769 @default.
• W2108481891 hasConceptScore W2108481891C192034797 @default.
• W2108481891 hasConceptScore W2108481891C199360897 @default.
• W2108481891 hasConceptScore W2108481891C202973057 @default.
• W2108481891 hasConceptScore W2108481891C25016198 @default.
• W2108481891 hasConceptScore W2108481891C41008148 @default.
• W2108481891 hasConceptScore W2108481891C80444323 @default.
• W2108481891 hasIssue "12" @default.
• W2108481891 hasLocation W21084818911 @default.
• W2108481891 hasOpenAccess W2108481891 @default.
• W2108481891 hasPrimaryLocation W21084818911 @default.
• W2108481891 hasRelatedWork W1528032490 @default.
• W2108481891 hasRelatedWork W2106934209 @default.
• W2108481891 hasRelatedWork W2108481891 @default.
• W2108481891 hasRelatedWork W2151898527 @default.
• W2108481891 hasRelatedWork W2887835352 @default.
• W2108481891 hasRelatedWork W2903954122 @default.
• W2108481891 hasRelatedWork W2971834608 @default.
• W2108481891 hasRelatedWork W3037249291 @default.
• W2108481891 hasRelatedWork W4289699955 @default.
• W2108481891 hasRelatedWork W47563837 @default.
• W2108481891 hasVolume "58" @default.
• W2108481891 isParatext "false" @default.
• W2108481891 isRetracted "false" @default.
• W2108481891 magId "2108481891" @default.
• W2108481891 workType "article" @default.