Expressiveness of propositional projection temporal logic with star (Q2430015): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Framed temporal logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decision procedure for propositional projection temporal logic with infinite models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal logic can be more expressive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3668862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3341881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3725528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3745263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of propositional projection temporal logic with star / rank
 
Normal rank

Latest revision as of 23:17, 3 July 2024

scientific article
Language Label Description Also known as
English
Expressiveness of propositional projection temporal logic with star
scientific article

    Statements

    Expressiveness of propositional projection temporal logic with star (English)
    0 references
    0 references
    0 references
    5 April 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    temporal logic
    0 references
    expressiveness
    0 references
    automata theory
    0 references
    regular expressions
    0 references
    verification
    0 references
    Büchi automata
    0 references
    regular language
    0 references
    0 references