Model Checking FO(R) over One-Counter Processes and beyond (Q3644768): Difference between revisions

From MaRDI portal
Added link to MaRDI 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.1007/978-3-642-04027-6_35 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1487351738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic Model Checking of Tense Logics on Rational Kripke Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A uniform method for proving lower bounds on the computational complexity of logical theories / 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: First-order logic with two variables and unary temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of logical theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: The succinctness of first-order logic on linear orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on emptiness for alternating finite automata with a one-letter alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: DP lower bounds for equivalence-checking and model-checking of one-counter automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of computation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability problems on regular ground tree rewriting graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic uses of the Feferman-Vaught theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of model checking with the temporal logic EF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508307 / 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: Logically defined subsets of \(\mathbb{N}{}^ k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On compositionality and its limitations / 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: Mathematical Foundations of Computer Science 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recurrent Reachability Analysis in Regular Model Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pushdown processes: Games and model-checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Synchronized Products of Infinite Transition Systems / rank
 
Normal rank

Latest revision as of 03:32, 2 July 2024

scientific article
Language Label Description Also known as
English
Model Checking FO(R) over One-Counter Processes and beyond
scientific article

    Statements

    Model Checking FO(R) over One-Counter Processes and beyond (English)
    0 references
    0 references
    12 November 2009
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers