Bisimulation-based Non-deterministic Admissible Interference and its Application to the Analysis of Cryptographic Protocols (Q2841265): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Reasoning about cryptographic protocols in the spi calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3700824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4330563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4499293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4493894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4295369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2709234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of bisimulation equivalence for normed pushdown processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of DPDA equivalence / rank
 
Normal rank

Latest revision as of 15:41, 6 July 2024

scientific article
Language Label Description Also known as
English
Bisimulation-based Non-deterministic Admissible Interference and its Application to the Analysis of Cryptographic Protocols
scientific article

    Statements

    Bisimulation-based Non-deterministic Admissible Interference and its Application to the Analysis of Cryptographic Protocols (English)
    0 references
    0 references
    0 references
    24 July 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers