Ordered multi-stack visibly pushdown automata (Q344793): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 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.2016.08.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2512356998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibly pushdown languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pushdown module checking with imperfect information / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Multi to Single Stack Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-Checking of Ordered Multi-Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emptiness of Multi-pushdown Automata Is 2ETIME-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: ADJACENT ORDERED MULTI-PUSHDOWN SYSTEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Expressive Power of 2-Stack Visibly Pushdown Automata / 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: Verification of well-formed communicating recursive state machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pushdown module checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Visibly Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3336675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enriched MU-Calculi Module Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability Analysis of Communicating Pushdown Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / 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: Q4428305 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Language Theory of Bounded Context-Switching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scope-Bounded Pushdown Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unifying Approach for Multistack Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can message buffers be axiomatized in linear temporal logic? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient CTL Model-Checking for Pushdown Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata-theoretic techniques for modal logics of programs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 23:32, 12 July 2024

scientific article
Language Label Description Also known as
English
Ordered multi-stack visibly pushdown automata
scientific article

    Statements

    Ordered multi-stack visibly pushdown automata (English)
    0 references
    0 references
    0 references
    0 references
    24 November 2016
    0 references
    visibly automata
    0 references
    formal verification
    0 references
    model checking
    0 references
    pushdown automata
    0 references
    automata-theoretic approach to system verification
    0 references
    formal languages
    0 references

    Identifiers