Past pushdown timed automata and safety verification. (Q1426159): Difference between revisions

From MaRDI portal
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.tcs.2003.10.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2117431842 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4817528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A really temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability analysis of pushdown automata: Application to model-checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4270062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counter machines and verification problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4302435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385530 / rank
 
Normal rank

Latest revision as of 15:49, 6 June 2024

scientific article
Language Label Description Also known as
English
Past pushdown timed automata and safety verification.
scientific article

    Statements

    Past pushdown timed automata and safety verification. (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 March 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    Timed automata
    0 references
    Automated verification
    0 references
    Temporal logic
    0 references
    Past formulas
    0 references
    Presburger arithmetic
    0 references
    0 references