\textit{Once} and \textit{for all} (Q439961): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jcss.2011.08.006 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03B44 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q60 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6067713 / rank
 
Normal rank
Property / zbMATH Keywords
 
temporal logic
Property / zbMATH Keywords: temporal logic / rank
 
Normal rank
Property / zbMATH Keywords
 
past-time operators
Property / zbMATH Keywords: past-time operators / rank
 
Normal rank
Property / zbMATH Keywords
 
expressive power
Property / zbMATH Keywords: expressive power / rank
 
Normal rank
Property / zbMATH Keywords
 
decision procedures
Property / zbMATH Keywords: decision procedures / rank
 
Normal rank
Property / zbMATH Keywords
 
alternating automata
Property / zbMATH Keywords: alternating automata / 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.jcss.2011.08.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2165306422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3246315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3711745 / 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: Q3740223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata-theoretic techniques for modal logics of programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of temporal logics with past / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ockhamist Computational Logic: Past-Sensitive Necessitation in CTL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3906386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic verification of finite-state concurrent systems using temporal logic specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision procedures and expressiveness in the temporal logic of branching time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding full branching time logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of CTL* + Linear Past / 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: Temporal logic in specification. Altrincham, UK, April 8-10, 1987. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: “Sometimes” and “not never” revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal logic can be more expressive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating automata on infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about infinite computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theories of automata on \(\omega\)-tapes: a simplified approach / 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: Propositional dynamic logic of regular programs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCSS.2011.08.006 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:44, 9 December 2024

scientific article
Language Label Description Also known as
English
\textit{Once} and \textit{for all}
scientific article

    Statements

    \textit{Once} and \textit{for all} (English)
    0 references
    0 references
    0 references
    0 references
    17 August 2012
    0 references
    temporal logic
    0 references
    past-time operators
    0 references
    expressive power
    0 references
    decision procedures
    0 references
    alternating automata
    0 references

    Identifiers