On temporal logics with data variable quantifications: decidability and complexity (Q342712): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(8 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ic.2016.08.002 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: TeMP / rank
 
Normal rank
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.ic.2016.08.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2518211214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using branching time temporal logic to synthesize synchronization skeletons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concerning the semantic consequence relation in first-order temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete axiomatic characterization of first-order temporal logic of linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incompleteness of first-order temporal logic with until / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidable fragments of first-order temporal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: LTL with the freeze quantifier and register automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating register automata on finite words and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal Logics on Words with Multiple Data Values. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about Data Repetitions with Counter Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered Navigation on Multi-attributed Data Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Systems and Specifications with Parameterized Atomic Propositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Automata-Theoretic Approach to Reasoning about Parameterized Systems and Specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Game-Theoretic Approach to Simulation of Data-Parameterized Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic analysis of array-accessing programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2978518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monodic temporal resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanising first-order temporal resolution / 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: Pushdown Model Checking for Malware Detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: LTL Model-Checking for Malware Detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about networks with many identical finite state processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about systems with many processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723423 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Reasoning About Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-memory automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Automata over Infinite Alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779173 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasible Automata for Two-Variable Logic with Successor on Data Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4649570 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of data automata that captures XPath / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4964723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CLASS COUNTING AUTOMATA ON DATAWORDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending two-variable logic on data trees with order on data values and its automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On pebble automata for data languages with decidable emptiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Reachability and Pebble Automata over Infinite Alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and algorithms for the construction and analysis of systems. 20th international conference, TACAS 2014, held as part of the European joint conferences on theory and practice of software, ETAPS 2014, Grenoble, France, April 5--13, 2014. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, logics, and infinite games. A guide to current research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-variable logic on data words / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Freeze LTL with Ordered Attributes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On notions of regularity for data languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the universal and existential fragments of the \(\mu\)-calculus / 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: Context-free languages over infinite alphabets / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IC.2016.08.002 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:55, 9 December 2024

scientific article
Language Label Description Also known as
English
On temporal logics with data variable quantifications: decidability and complexity
scientific article

    Statements

    On temporal logics with data variable quantifications: decidability and complexity (English)
    0 references
    0 references
    0 references
    18 November 2016
    0 references
    temporal logics
    0 references
    data variable quantifications
    0 references
    satisfiability
    0 references
    model checking
    0 references
    decidability and complexity
    0 references
    alternating register automata
    0 references
    data automata
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers