WorldCat Linked Data Explorer

Turtle N-Triple JSON-LD RDF/XML HTML Contact Us Home

http://worldcat.org/entity/work/id/22646849

Using mappings to prove timing properties

A new technique for proving timing properties for timing-based algorithms is described; it is an extension of the mapping techniques previously used in proofs of safety properties for asynchronous concurrent systems. The key to the method is a way of representing timing information. Timing assumptions and timing requirements for the system are both represented in this way. A multivalued mapping from the assumptions automation to the requirements automation is then used to show that the given system satisfies the requirements. The technique is illustrated with two simple examples, a resource manager and a signal relay. Keywords: Formal specification; Formal verification; Assertional reasoning, Possibilities mappings; Timed automata; I/O automata. (kr).

Open All Close All

type

about

http://schema.org/about

alternateName

http://schema.org/alternateName

  • "Prove timing properties, using mapping to"@en
  • "Prove timing properties, Using mappings to"@en

author

contributor

creator

description

http://schema.org/description

  • "A new technique for proving timing properties for timing based algorithms is described; it is an extension of the mapping techniques previously used in proofs of safety properties for asynchronous concurrent systems. The key to the method is a way of representing a system with timing constraints as an automaton whose state includes predictive timing information. Timing assumptions and timing requirements for the system are both represented in this way. A multi-valued mapping from the assumptions automaton to the requirements automaton is then used to show that the given system satisfies the requirements. One type of mapping is based on a collection of variant functions providing measures of progress toward timing goals. The technique is illustrated with two examples, a simple resource manager and a two-process race system."
  • "A new technique for proving timing properties for timing-based algorithms is described; it is an extension of the mapping techniques previously used in proofs of safety properties for asynchronous concurrent systems. The key to the method is a way of representing timing information. Timing assumptions and timing requirements for the system are both represented in this way. A multivalued mapping from the assumptions automation to the requirements automation is then used to show that the given system satisfies the requirements. The technique is illustrated with two simple examples, a resource manager and a signal relay. Keywords: Formal specification; Formal verification; Assertional reasoning, Possibilities mappings; Timed automata; I/O automata. (kr)."@en
  • "A new technique for proving timing properties for timing-based algorithms is described; it is an extension of the mapping techniques previously used in proofs of safety properties for asynchronous concurrent systems. The key to the method is a way of representing a system with timing constraints as an automation whose state includes predictive timing information. Timing assumptions and timing requirements for the system are both represented in this way. A multi-valued mapping from the assumptions automation to the requirements automation is then used to show that the given system satisfies the requirements. One type of mapping is based on a collection of progress functions providing measures of progress toward timing goals. The technique is illustrated with two examples, a simple resource manager and a two-process race system."@en

name

http://schema.org/name

  • "Using mappings to prove timing properties"@en
  • "Using mappings to prove timing properties"
  • "Using Mappings to Prove Timing Properties"
  • "Using Mappings to Prove Timing Properties"@en

workExample