Finite axiomatization for symbolic probabilistic -calculus

DOI10.1007/S12204-009-0536-YzbMATH Open1202.68267OpenAlexW2009408173MaRDI QIDQ615236FDOQ615236

Lei Song, Yuxin Deng

Publication date: 5 January 2011

Published in: Journal of Shanghai Jiaotong University (Science) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12204-009-0536-y

zbMATH Keywords

axiomatizationprobabilistic process calculussymbolic bisimulation

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reactive, generative, and stratified models of probabilistic processes
• Axiomatizations for probabilistic finite-state behaviors
• Weak bisimulation for probabilistic timed automata
• Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus.
• Finite axiomatization for symbolic probabilistic \(\pi \)-calculus

Cited In (2)

• Finite axiomatization for symbolic probabilistic \(\pi \)-calculus
• Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\)

This page was built for publication: Finite axiomatization for symbolic probabilistic \(\pi \)-calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q615236)