Equivalence of recursive specifications in process algebra (Q1607118): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the consistency of Koomen's fair abstraction rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic solutions to recursion schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalences and transformations of regular systems - applications to recursive program schemes and grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4312484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearization in parallel pCRL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5537599 / rank
 
Normal rank

Latest revision as of 11:05, 4 June 2024

scientific article
Language Label Description Also known as
English
Equivalence of recursive specifications in process algebra
scientific article

    Statements

    Equivalence of recursive specifications in process algebra (English)
    0 references
    0 references
    0 references
    25 July 2002
    0 references
    recursive specifications
    0 references
    process algebra
    0 references
    specification language
    0 references
    \(\mu\)CRL
    0 references

    Identifiers