Compositional verification of concurrent systems by combining bisimulations (Q2147689): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Derivatives of Regular Expressions / 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: Three logics for branching bisimulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional dynamic logic of regular programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositional verification of asynchronous concurrent systems using CADP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial order approach to branching time logic model checking. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3191614 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluence for process verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the propositional \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Model Checking Using Networks of Labelled Transition Systems and Boolean Equation Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp Congruences Adequate with Temporal Logics Combining Weak and Strong Modalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3792217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential and distributed on-the-fly computation of weak tau-confluence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3700812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial-order reduction in the weak modal mu-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional dynamic logic of looping and converse is elementarily decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: An automata theoretic decision procedure for the propositional mu- calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching time and abstraction in bisimulation semantics / rank
 
Normal rank

Revision as of 09:09, 29 July 2024

scientific article
Language Label Description Also known as
English
Compositional verification of concurrent systems by combining bisimulations
scientific article

    Statements

    Compositional verification of concurrent systems by combining bisimulations (English)
    0 references
    0 references
    0 references
    0 references
    20 June 2022
    0 references
    concurrency theory
    0 references
    labelled transition system
    0 references
    modal mu-calculus
    0 references
    model checking
    0 references
    state space reduction
    0 references
    temporal logic
    0 references
    0 references
    0 references
    0 references

    Identifiers