Finite axiomatization for symbolic probabilistic -calculus
From MaRDI portal
(Redirected from Publication:615236)
Finite axiomatization for symbolic probabilistic \(\pi \)-calculus
Finite axiomatization for symbolic probabilistic \(\pi \)-calculus
Recommendations
Cites work
- scientific article; zbMATH DE number 1759621 (Why is no real title available?)
- scientific article; zbMATH DE number 1863164 (Why is no real title available?)
- scientific article; zbMATH DE number 794262 (Why is no real title available?)
- Axiomatizations for probabilistic finite-state behaviors
- Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus.
- Finite axiomatization for symbolic probabilistic \(\pi \)-calculus
- Reactive, generative, and stratified models of probabilistic processes
- Weak bisimulation for probabilistic timed automata
Cited in
(7)- Sound and complete axiomatization of trace semantics for probabilistic systems
- Processes, Terms and Cycles: Steps on the Road to Infinity
- A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice
- Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours
- Finite axiomatization for symbolic probabilistic \(\pi \)-calculus
- Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\)
- Axiomatizations for probabilistic finite-state behaviors
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)