Task automata: Schedulability, decidability and undecidability (Q2643078)

From MaRDI portal
Revision as of 00:03, 29 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Task automata: Schedulability, decidability and undecidability
scientific article

    Statements

    title
    Task automata: Schedulability, decidability and undecidability (English)
    0 references
    author
    Elena Fersman
    0 references
    Pavel Krcal
    0 references
    Paul Pettersson
    0 references
    Wang Yi
    0 references
    publication date
    23 August 2007
    0 references
    Mathematics Subject Classification ID
    68Q45
    0 references
    68Q10
    0 references
    68Q60
    0 references
    zbMATH DE Number
    5182186
    0 references
    zbMATH Keywords
    real time systems
    0 references
    schedulability analysis
    0 references
    timed automata
    0 references
    modeling and verification
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2643078&oldid=23578943"
    Powered by MediaWiki