An <i>O</i> ( <i>m</i> log <i>n</i> ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation (Q5278211): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: mCRL2 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TVT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CADP / rank
 
Normal rank
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.1145/3060140 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2663462053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2845494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing finite Kripke structures in propositional temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Overview of the mCRL2 Toolset and Its Recent Advances / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cure for Stuttering Parity Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three logics for branching bisimulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implementation of an efficient algorithm for bisimulation equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation Tree Logic with Deadlock Detection / 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: Q3191614 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CCS expressions, finite state processes, and three problems of equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5339289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus of communicating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizing the Paige-Tarjan algorithm by abstract interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimilarity Minimization in O(m logn) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Minimization of DFAs with Partial Transition Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding orthogonal bisimulation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:34, 14 July 2024

scientific article; zbMATH DE number 6744625
Language Label Description Also known as
English
An <i>O</i> ( <i>m</i> log <i>n</i> ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation
scientific article; zbMATH DE number 6744625

    Statements

    An <i>O</i> ( <i>m</i> log <i>n</i> ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 July 2017
    0 references
    branching bisimulation
    0 references
    algorithm
    0 references
    stuttering equivalence
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references