Complexity of equivalence problems for concurrent systems of finite agents (Q1383143): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Theory of Communicating Sequential Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3777424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / 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: Three Partition Refinement Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking equivalences between concurrent systems of finite agents (Extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank

Latest revision as of 11:00, 28 May 2024

scientific article
Language Label Description Also known as
English
Complexity of equivalence problems for concurrent systems of finite agents
scientific article

    Statements

    Complexity of equivalence problems for concurrent systems of finite agents (English)
    0 references
    16 July 1998
    0 references
    concurrent system
    0 references
    synchronous communicating agents
    0 references

    Identifiers