Complexity results on branching-time pushdown model checking (Q2373715): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Reachability analysis of pushdown automata: Application to model-checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3336675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic verification of finite-state concurrent systems using temporal logic specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using branching time temporal logic to synthesize synchronization skeletons / rank
 
Normal rank
Property / cites work
 
Property / cites work: “Sometimes” and “not never” revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking LTL with regular valuations for pushdown systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4428305 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An automata-theoretic approach to branching-time model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of ends, pushdown automata, and second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating automata on infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / 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: Q4219045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer aided verification. 8th international conference, CAV '96, New Brunswick, NJ, USA, July 31 -- August 3, 1996. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472439 / rank
 
Normal rank

Latest revision as of 12:13, 26 June 2024

scientific article
Language Label Description Also known as
English
Complexity results on branching-time pushdown model checking
scientific article

    Statements

    Complexity results on branching-time pushdown model checking (English)
    0 references
    0 references
    16 July 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    infinite-state systems
    0 references
    pushdown systems
    0 references
    model checking
    0 references
    regular propositional temporal logics
    0 references
    0 references