Symbolic Termination and Confluence Checking for ECA Rules (Q3452476): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2769596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ten Years of Saturation: A Petri Net Perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: AI 2003: Advances in Artificial Intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4946958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4738633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4790640 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3933750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4438797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic CTL Model Checking of Asynchronous Systems Using Constrained Saturation / rank
 
Normal rank

Latest revision as of 01:13, 11 July 2024

scientific article
Language Label Description Also known as
English
Symbolic Termination and Confluence Checking for ECA Rules
scientific article

    Statements

    Symbolic Termination and Confluence Checking for ECA Rules (English)
    0 references
    0 references
    0 references
    0 references
    12 November 2015
    0 references
    ECA rules
    0 references
    termination
    0 references
    confluence
    0 references
    verification
    0 references

    Identifiers