Finite axiomatization for symbolic probabilistic \(\pi \)-calculus
From MaRDI portal
Publication:615236
DOI10.1007/s12204-009-0536-yzbMath1202.68267MaRDI QIDQ615236
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
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weak bisimulation for probabilistic timed automata
- Finite axiomatization for symbolic probabilistic \(\pi \)-calculus
- Axiomatizations for probabilistic finite-state behaviors
- Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus.
- Reactive, generative, and stratified models of probabilistic processes