A translation of TPAL_p into a class of timed-probabilistic Petri nets
From MaRDI portal
Publication:557805
Recommendations
Cites work
- A model of probabilistic processes
- A timed model for communicating sequential processes
- Algebraic theory of probabilistic and nondeterministic processes.
- Algebraic theory of probabilistic processes.
- Bisimulation through probabilistic testing
- Discrete time generative-reactive probabilistic processes with different advancing speeds
- Finite representations of CCS and TCSP programs by automata and Petri nets
- scientific article; zbMATH DE number 1696456 (Why is no real title available?)
- scientific article; zbMATH DE number 1696898 (Why is no real title available?)
- scientific article; zbMATH DE number 4060688 (Why is no real title available?)
- scientific article; zbMATH DE number 54260 (Why is no real title available?)
- scientific article; zbMATH DE number 140226 (Why is no real title available?)
- scientific article; zbMATH DE number 1755138 (Why is no real title available?)
- Nets, Terms and Formulas
- Process algebra with timing
- Process algebra with timing: Real time and discrete time
- Reactive, generative, and stratified models of probabilistic processes
- TIC: a tImed calculus
This page was built for publication: A translation of \(\text{TPAL}_{p}\) into a class of timed-probabilistic Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557805)