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)
- 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)
