## Quantitative methods in parallel systemsThe Handbook of Feynman Path Integrals appears just fifty years after Richard Feynman published his pioneering paper in 1948 entitled 'Space-Time Approach to Non-Relativistic Quantum Mechanics', in which he introduced his new formulation of quantum mechanics in terms of path integrals. The book presents for the first time a comprehensive table of Feynman path integrals together with an extensive list of references; it will serve the reader as a thorough introduction to the theory of path integrals. As a reference book, it is unique in its scope and will be essential for many physicists, chemists and mathematicians working in different areas of research. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Stochastic Process Algebras | 3 |

Tool Support | 13 |

Language | 19 |

Copyright | |

34 other sections not shown

### Other editions - View all

Quantitative Methods in Parallel Systems Francois Baccelli,Alain Jean-Marie,Isi Mitrani Limited preview - 2013 |

Quantitative Methods in Parallel Systems Francois Baccelli,Alain Jean-Marie,Isi Mitrani No preview available - 2011 |

### Common terms and phrases

aggregated subsystem algorithm allocation application arrival theorems assumed average basic behaviour bisimulation bounds buffer cache complete computation consider constraints corresponding customer types defined denoted derived DSSP equation equivalence example execution exponential exponentially distributed finite firing formalism function G-networks Gelenbe GSPN model Hillston IEEE inequality initial marking input INRIA intermediate markings iterative Lemma linear marked graphs Markov chain Markov process matrix mean sojourn method negative customers nodes obtained operational operational semantics optimal parallel Performance Evaluation Performance Modelling Petri Nets PF-SPN place pj positive customers probabilistic probability problem Proc processor product form properties queue length queueing model queueing networks random variables random walks reachable relation represented restart Rettelbach S-invariant scheduling semantics server simulation solution Sophia Antipolis Stochastic Petri Nets Stochastic Process Algebras structure subnet subtasks task graph techniques throughput tion TIPP transition unit disk