Convenient category of processes and simulations I: Modulo strong bisimilarity (Q5057463): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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/3-540-60164-3_17 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1511705245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A final coalgebra theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Terminal coalgebras in well-founded set theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation of automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebra of communicating processes with abstraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3978985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4877444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4870809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843177 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:03, 31 July 2024

scientific article; zbMATH DE number 7633574
Language Label Description Also known as
English
Convenient category of processes and simulations I: Modulo strong bisimilarity
scientific article; zbMATH DE number 7633574

    Statements

    Convenient category of processes and simulations I: Modulo strong bisimilarity (English)
    0 references
    0 references
    16 December 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers