Verification of qualitative \(\mathbb Z\) constraints (Q959820): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2008.07.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059905982 / 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: Programs with Lists Are Counter Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039803 / 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: Untiming timed languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flat Parametric Counter Automata / 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: Q2753678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding properties of integral relational automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: An automata-theoretic approach to constraint LTL / rank
 
Normal rank
Property / cites work
 
Property / cites work: LTL over integer periodicity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Model-Checker for Counter Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2005 – Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE EXISTENCE OF ω-CHAINS FOR TRANSITIVE MIXED LINEAR RELATIONS AND ITS APPLICATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presburger liveness verification of discrete timed automata. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4415251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2003 - Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A classification of symbolic transition systems / 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: Q4474093 / 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: Q4778773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NEXP TIME-complete description logics with concrete domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Languages and Systems / 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: Automata for branching and layered temporal structures. An investigation into regularities of infinite transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to constraint databases / 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: Reasoning about infinite computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal logic can be more expressive / rank
 
Normal rank

Latest revision as of 22:44, 28 June 2024

scientific article
Language Label Description Also known as
English
Verification of qualitative \(\mathbb Z\) constraints
scientific article

    Statements

    Verification of qualitative \(\mathbb Z\) constraints (English)
    0 references
    0 references
    0 references
    12 December 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    temporal logic
    0 references
    arithmetical constraint
    0 references
    Büchi automaton
    0 references
    symbolic model
    0 references
    complexity
    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