Visibly linear temporal logic (Q682377): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10817-017-9410-z / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: SPIN / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Bebop / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10817-017-9410-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2593997315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Marrying Words and Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-Order and Temporal Logics for Nested Words / 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: 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: Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibly Rational Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibly rational expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation Elimination for Automata over Nested Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: On regular temporal logics with past / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional dynamic logic of regular programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic linear time temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal logic can be more expressive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak alternating automata are not that weak / 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: Regular Linear Temporal Logic / 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: Query Automata for Nested Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating finite automata on \(\omega\)-words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating automata on infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Linear Temporal Logic with Past / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Translate Efficiently Extensions of Temporal Logics into Alternating Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about infinite computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibly Linear Dynamic Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite games on finitely coloured graphs with applications to automata on infinite trees / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10817-017-9410-Z / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:45, 10 December 2024

scientific article
Language Label Description Also known as
English
Visibly linear temporal logic
scientific article

    Statements

    Visibly linear temporal logic (English)
    0 references
    0 references
    0 references
    2 February 2018
    0 references
    temporal logic
    0 references
    visibly pushdown languages
    0 references
    automata-based decision procedures
    0 references
    automata theory
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers