Computing maximal weak and other bisimulations (Q510897): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: FDR3 / 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.1007/s00165-016-0366-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2330102972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing maximal weak and other bisimulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2842853 / 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: An efficient algorithm for computing 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: FDR3 — A Modern Refinement Checker for CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3777424 / 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: Q3929062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4703894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Understanding concurrent systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of bisimulation for the \(\pi\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint spanning trees and depth-first search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sigref – A Symbolic Bisimulation Tool Box / rank
 
Normal rank

Latest revision as of 10:58, 13 July 2024

scientific article
Language Label Description Also known as
English
Computing maximal weak and other bisimulations
scientific article

    Statements

    Computing maximal weak and other bisimulations (English)
    0 references
    0 references
    0 references
    0 references
    14 February 2017
    0 references
    0 references
    CSP
    0 references
    FDR
    0 references
    bisimulation
    0 references
    strong bisimulation
    0 references
    delay bisimulation
    0 references
    weak bisimulation
    0 references
    labelled transition systems
    0 references
    model-checking
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references