Deciding orthogonal bisimulation (Q2461535): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Characterizing finite Kripke structures in propositional temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching time and orthogonal bisimulation equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4299862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching time and abstraction in bisimulation semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic laws for nondeterminism and concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus of communicating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3929062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The compression structure of a process / rank
 
Normal rank

Latest revision as of 12:36, 27 June 2024

scientific article
Language Label Description Also known as
English
Deciding orthogonal bisimulation
scientific article

    Statements

    Deciding orthogonal bisimulation (English)
    0 references
    0 references
    28 November 2007
    0 references
    Concurrency theory
    0 references
    Orthogonal bisimulation equivalence
    0 references
    Branching bisimulation equivalence
    0 references
    Silent step
    0 references
    Labeled transition system
    0 references

    Identifiers