Decidable first-order transition logics for PA-processes (Q2575856): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Parametric temporal logic for “model measuring” / rank
 
Normal rank
Property / cites work
 
Property / cites work: A really temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of bisimulation equivalence for process generating context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4270062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4353915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for pre* and post* on interprocedural parallel flow graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5576254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2771057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding bisimulation-like equivalences with finite-state processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic model checking with rich assertional languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Parallelize sequential processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3150206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The regular viewpoint on PA-processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tableau methods for PA-processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process rewrite systems. / 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: Basic theory of feature trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structural approach to operational semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite tree automata with cost functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized finite automata theory with an application to a decision problem of second-order logic / rank
 
Normal rank

Latest revision as of 13:51, 11 June 2024

scientific article
Language Label Description Also known as
English
Decidable first-order transition logics for PA-processes
scientific article

    Statements

    Decidable first-order transition logics for PA-processes (English)
    0 references
    0 references
    0 references
    7 December 2005
    0 references
    0 references
    Regular model checking
    0 references
    Verification of recursive parallel systems
    0 references
    Transition logics
    0 references
    Regular tree languages
    0 references
    0 references