Using mappings to prove timing properties (Q1200918): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existence of refinement mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time logics: Complexity and expressiveness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4723289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph-Theoretic Approach for Timing Analysis and its Implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specifying Concurrent Program Modules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using mappings to prove timing properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3833630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculi for synchrony and asynchrony / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for real-time discrete event control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795193 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02252683 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043695863 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:21, 30 July 2024

scientific article
Language Label Description Also known as
English
Using mappings to prove timing properties
scientific article

    Statements

    Using mappings to prove timing properties (English)
    0 references
    0 references
    0 references
    16 January 1993
    0 references
    assertional reasoning
    0 references
    possibilities mappings
    0 references
    timed automata
    0 references
    I/O automata
    0 references
    progress functions
    0 references
    safety
    0 references
    concurrent algorithms
    0 references
    time properties
    0 references
    timing-based algorithms
    0 references

    Identifiers