An Automata-Theoretic Approach to Infinite-State Systems (Q3587257): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Languages of Nested Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating-time temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibly pushdown languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding Nesting Structure to Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-walking automata do not recognize all regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4553262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity Problems for Visibly Pushdown Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pushdown Module Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4553257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On infinite transition graphs having a decidable monadic theory / 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: Q4551177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4269133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On model checking for the \(\mu\)-calculus and its fragments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5714447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3739111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4353562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional dynamic logic of regular programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial approach to model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata for the modal μ-calculus and related results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the analysis of interacting pushdown systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic Model Checking of Concurrent Programs Using Partial Orders and On-the-Fly Transactions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the propositional \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4270071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Bounded Specifications / 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: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3711745 / 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: Q4411812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4205072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From bidirectionality to alternation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3940830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Second-Order Theories and Automata on Infinite Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computation Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical CTL* model checking: Should SPIN be extended? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata-theoretic techniques for modal logics of programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about infinite computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order logic on tree-like structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501666 / rank
 
Normal rank

Latest revision as of 04:36, 3 July 2024

scientific article
Language Label Description Also known as
English
An Automata-Theoretic Approach to Infinite-State Systems
scientific article

    Statements

    An Automata-Theoretic Approach to Infinite-State Systems (English)
    0 references
    0 references
    0 references
    0 references
    7 September 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references