Deciding safety and liveness in TPTL (Q402360): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2014.06.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2127730150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safety, liveness and fairness in temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving the Correctness of Multiprocess Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defining liveness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking of safety properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A brief account of runtime verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: A really temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidable fragments of first-order temporal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of propositional linear temporal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999206 / rank
 
Normal rank

Latest revision as of 23:33, 8 July 2024

scientific article
Language Label Description Also known as
English
Deciding safety and liveness in TPTL
scientific article

    Statements

    Deciding safety and liveness in TPTL (English)
    0 references
    0 references
    0 references
    0 references
    28 August 2014
    0 references
    formal methods
    0 references
    real-time systems
    0 references
    temporal logic
    0 references
    safety and liveness
    0 references
    verification
    0 references
    computational complexity
    0 references

    Identifiers