Bisimulation collapse and the process taxonomy (Q6104377): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-61604-7_59 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1480220904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3774929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An elementary bisimulation decision procedure for arbitrary context-free processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular canonical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphes canoniques de graphes algébriques / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the regular structure of prefix rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of the decidability of bisimulation for normed BPA- processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of bisimulation equivalence for normed pushdown processes / rank
 
Normal rank

Latest revision as of 12:37, 1 August 2024

scientific article; zbMATH DE number 7703595
Language Label Description Also known as
English
Bisimulation collapse and the process taxonomy
scientific article; zbMATH DE number 7703595

    Statements

    Identifiers