Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems
algebraautomatacoinductionmachine learningMarkov chainsnumerical analysisprobabilistic systemstream calculusverification
Other algebras related to logic (03G25) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Continuous-time Markov processes on discrete state spaces (60J27) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) General topics of discrete mathematics in relation to computer science (68R01)
The articles of this volume will not be indexed individually. The book consists of two sets of lecture notes devoted to slightly different methods of analysis of concurrent and probabilistic computational systems. The first set of lectures develops a calculus of streams (a generalization of the set of natural numbers) based on the coinduction principle coming from the theory of coalgebras. It is now well understood that the interplay between algebra (for describing structure) and coalgebra (for describing dynamics) is crucial for understanding concurrent systems. There is a striking analogy between streams and formula calculus reminiscent of those appearing in quantum calculus. These lecture notes will appeal to anyone working in concurrency theory but also to algebraists and logicians. The other set of lecture notes focuses on methods for automatically verifying probabilistic systems using techniques of model checking. The unique aspect of these lectures is the coverage of both theory and practice. The authors have been responsible for one of the most successful experimental systems for probabilistic model checking. These lecture notes are of interest to software engineers, real-time programmers, researchers in machine learning and numerical analysts who may well be interested to see how standard numerical techniques are used in a novel context. Both sets of lectures are expository and suitable for graduate courses in theoretical computer science and for research mathematicians interested in design and analysis of concurrent and probabilistic computational systems.
- Introduction to Probabilistic Concurrent Systems
- Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
- Abstraction, refinement and proof for probabilistic systems.
- Computing Behavioral Relations for Probabilistic Concurrent Systems
- Probability and Nondeterminism in Operational Models of Concurrency
- A spectral property for concurrent systems and some probabilistic applications
- Measure and probability for concurrency theorists
- Quantitative Analysis of Randomized Distributed Systems and Probabilistic Automata
- Exact quantitative probabilistic model checking through rational search
- Model checking single agent behaviours by fluid approximation
- On the collective sort problem for distributed tuple spaces
- Reachability analysis of uncertain systems using bounded-parameter Markov decision processes
- Real-reward testing for probabilistic processes
- Probabilistic model checking of complex biological pathways
- Least upper bounds for probability measures and their applications to abstractions
- An inductive technique for parameterised model checking of degenerative distributed randomised protocols
- An approach for lifetime reliability analysis using theorem proving
- Undecidable cases of model checking probabilistic temporal-epistemic logic (extended abstract)
- Model checking linear-time properties of probabilistic systems
- Probabilistic Analysis of Binary Sessions
- Reasoning about conditional probabilities in a higher-order-logic theorem prover
- Formal reliability analysis of combinational circuits using theorem proving
- Model-Checking ω-Regular Properties of Interval Markov Chains
- Bounded Verification of Reachability of Probabilistic Hybrid Systems
- Stability analysis of planar probabilistic piecewise constant derivative systems
- Quantitative analysis with the probabilistic model checker PRISM
- Efficient checking of individual rewards properties in Markov population models
- Beyond decisiveness of infinite Markov chains
- Formal probabilistic analysis of detection properties in wireless sensor networks
- Formalization of the standard uniform random variable
This page was built for publication: Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4821979)