PDL with intersection and converse: satisfiability and infinite-state model checking (Q3616354): Difference between revisions

From MaRDI portal
Added link to MaRDI 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.2178/jsl/1231082313 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2019785612 / 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: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4406531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A near-optimal method for reasoning about action / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modal Perspective on Path Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating automata on infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: PDL for ordered trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of model checking with the temporal logic EF / rank
 
Normal rank
Property / cites work
 
Property / cites work: PDL with negation of atomic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The regular viewpoint on PA-processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer aided verification. 14th international conference, CAV 2002, Copenhagen, Denmark, July 27--31, 2002. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarded fixed point logics and the monadic theory of countable trees. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite State Model-Checking of Propositional Dynamic Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional dynamic logic of regular programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pushdown processes: Games and model-checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: DAL -- a logic for data analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking LTL with regular valuations for pushdown systems / rank
 
Normal rank

Latest revision as of 05:10, 29 June 2024

scientific article
Language Label Description Also known as
English
PDL with intersection and converse: satisfiability and infinite-state model checking
scientific article

    Statements

    PDL with intersection and converse: satisfiability and infinite-state model checking (English)
    0 references
    0 references
    0 references
    0 references
    25 March 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    dynamic logic
    0 references
    satisfiability
    0 references
    model checking
    0 references
    automata
    0 references
    0 references