Process Algebra and Probabilistic Methods: Performance Modeling and Verification

TRAMA

This volume contains the proceedings of the second joint PAPM-PROBMIV Workshop, held at the University of Copenhagen, Denmark, July 25–26, 2002 as part of the Federated Logic Conference (FLoC 2002). The PAPM-PROBMIV workshop results from the combination of two wo- shops: PAPM (Process Algebras and Performance Modeling) and PROBMIV (Probabilistic Methods in Veri?cation). The aim of the joint workshop is to bring together the researchers working across the whole spectrum of techniques for the modeling, speci?cation, analysis, and veri?cation of probabilistic systems. Probability is widely used in the design and analysis of software and hardware systems, as a means to derive e?cient algorithms (e.g. randomization), as a model for unreliable or unpredictable behavior (as in the study of fault-tolerant systems and computer networks), and as a tool to study performance and - pendability properties. The topics of the workshop include speci?cation, m- els, and semantics of probabilistic systems, analysis and veri?cation techniques, probabilistic methods for the veri?cation of non-probabilistic systems, and tools and case studies. The ?rst PAPM workshop was held in Edinburgh in 1993; the following ones were held in Regensberg (1994), Edinburgh (1995), Turin (1996), Enschede (1997), Nice (1998), Zaragoza (1999), and Geneva (2000). The ?rst PROBMIV workshop was held in Indianapolis, Indiana (1998); the next one took place in Eindhoven (1999). In 2000, PROBMIV was replaced by a Dagstuhl seminar on Probabilistic Methods in Veri?cation.

SOMMARIO

Invited Contributions.- Failure Detection vs Group Membership in Fault-Tolerant Distributed Systems: Hidden Trade-Offs.- Probability and Timing: Challenges for Secure Programming.- Selected Papers.- Security Analysis of a Probabilistic Non-repudiation Protocol.- The Mean Value of the Maximum.- Reduction and Refinement Strategies for Probabilistic Analysis.- Action Refinement for Probabilistic Processes with True Concurrency Models.- Probabilistic Unfoldings and Partial Order Fairness in Petri Nets.- Possibilistic and Probabilistic Abstraction-Based Model Checking.- Out-of-Core Solution of Large Linear Systems of Equations Arising from Stochastic Modelling.- Model Checking CSL until Formulae with Random Time Bounds.- Probabilistic Model Checking of the IEEE 802.11 Wireless Local Area Network Protocol.- Deriving Symbolic Representations from Stochastic Process Algebras.- Short Abstracts.- A Generalization of Equational Proof Theory?.- An Integrated Approach for the Specification and Analysis of Stochastic Real-Time Systems.- Probabilistic Abstract Interpretation and Statistical Testing.- Approximate Verification of Probabilistic Systems.

ALTRE INFORMAZIONI

• Condizione: Nuovo
• ISBN: 9783540439134
• Collana: Lecture Notes in Computer Science
• Dimensioni: 235 x 155 mm
• Formato: Brossura
• Illustration Notes: X, 222 p.
• Pagine Arabe: 222
• Pagine Romane: x