Model-checking CTL* over flat Presburger counter systems (Q2901199): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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.3166/jancl.20.313-344 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2073466252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A really temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite presentations of infinite structures: Automata and interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On iterating linear transformations over recognizable sets of integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: More numerical evidence on the uniqueness of Markov Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programs with Lists Are Counter Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations / 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: About the decision of reachability for register machines / 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: LTL over integer periodicity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: “Sometimes” and “not never” revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Model-Checking Programs with Lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semigroups, Presburger formulas, and languages / 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: The 3x + 1 Problem and Its Generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specification in CTL + past for verification in CTL. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / 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: Pushdown processes: Games and model-checking / rank
 
Normal rank

Latest revision as of 12:16, 5 July 2024

scientific article
Language Label Description Also known as
English
Model-checking CTL* over flat Presburger counter systems
scientific article

    Statements

    Model-checking CTL* over flat Presburger counter systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 July 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references