1 option
Process Algebra and Probabilistic Methods. Performance Modelling and Verification : Joint International Workshop, PAPM-PROBMIV 2001, Aachen, Germany, September 12-14, 2001. Proceedings / edited by Luca de Alfaro, Stephen Gilmore.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 2165.
- Lecture Notes in Computer Science, 0302-9743 ; 2165
- Language:
- English
- Subjects (All):
- Algebra.
- Computers.
- Probabilities.
- Computer logic.
- Software engineering.
- Programming languages (Electronic computers).
- Theory of Computation.
- Probability Theory and Stochastic Processes.
- Logics and Meanings of Programs.
- Software Engineering.
- Programming Languages, Compilers, Interpreters.
- Local Subjects:
- Algebra.
- Theory of Computation.
- Probability Theory and Stochastic Processes.
- Logics and Meanings of Programs.
- Software Engineering.
- Programming Languages, Compilers, Interpreters.
- Physical Description:
- 1 online resource (XII, 224 pages).
- Edition:
- First edition 2001.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
- System Details:
- text file PDF
- Summary:
- This book constitutes the refereed proceedings of the Joint Workshop on Process Algebra and Performance Modeling and Probabilistic Methods in Verification, PAPM-PROBMIV 2001, held in Aachen, Germany in September 2001. The 12 revised full papers presented together with one invited paper were carefully reviewed and selected from 23 submissions. Among the topics addressed are model representation, model checking, probabilistic systems analysis, refinement, Markov chains, random variables, stochastic timed systems, Max-Plus algebra, process algebra, system modeling, and the Mobius modeling framework.
- Contents:
- Invited Paper
- Advances in Model Representations
- Contributed Papers
- Faster and Symbolic CTMC Model Checking
- Reachability Analysis of Probabilistic Systems by Successive Refinements
- Beyond Memoryless Distributions: Model Checking Semi-Markov Chains
- Coin Lemmas with Random Variables
- MoDeST - A Modelling and Description Language for Stochastic Timed Systems
- Randomization Helps in LTL Model Checking
- An Efficient Kronecker Representation for PEPA Models
- Reward Based Congruences: Can We Aggregate More?
- Using Max-Plus Algebra for the Evaluation of Stochastic Process Algebra Prefixes
- Expressing Processes with Different Action Durations through Probabilities
- Quantifying the Dynamic Behavior of Process Algebras
- Implementing a Stochastic Process Algebra within the Möbius Modeling Framework.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-44804-4
- 9783540448044
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.