Finite axiomatization for symbolic probabilistic \(\pi \)-calculus (Q615236): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Axiomatizations for probabilistic finite-state behaviors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reactive, generative, and stratified models of probabilistic processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak bisimulation for probabilistic timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite axiomatization for symbolic probabilistic \(\pi \)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus. / rank
 
Normal rank

Latest revision as of 14:19, 3 July 2024

scientific article
Language Label Description Also known as
English
Finite axiomatization for symbolic probabilistic \(\pi \)-calculus
scientific article

    Statements

    Finite axiomatization for symbolic probabilistic \(\pi \)-calculus (English)
    0 references
    0 references
    0 references
    5 January 2011
    0 references
    probabilistic process calculus
    0 references
    axiomatization
    0 references
    symbolic bisimulation
    0 references

    Identifiers