PRISM

swMATH1186MaRDI QIDQ13928FDOQ13928

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Relating PDEs in cylindrical coordinates and CTMCs with levels of concentration
• Bio-PEPA: A framework for the modelling and analysis of biological systems
• Reflections on the future of concurrency theory in general and process calculi in particular
• Optimal cost almost-sure reachability in POMDPs
• Infinite probability computation by cyclic explanation graphs
• Reo + \(\mathrm{mCRL2}\): a framework for model-checking dataflow in service compositions
• The how and why of interactive Markov chains
• Smoothed model checking for uncertain continuous-time Markov chains
• PuRSUE -- from specification of robotic environments to synthesis of controllers
• Spatial calculus of looping sequences
• What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives
• A static analysis framework for livelock freedom in CSP
• Theoretical Aspects of Computing - ICTAC 2004
• Modular modelling of signalling pathways and their cross-talk
• A Hybrid Approach to Modeling Biological Systems
• A Tool for the Automated Verification of Nash Equilibria in Concurrent Games
• Stochastic bigraphs
• Deciding probabilistic automata weak bisimulation: theory and practice
• Spatial calculus of looping sequences
• Hybrid dynamics of stochastic programs
• Safe autonomy under perception uncertainty using chance-constrained temporal logic
• DNA Walker Circuits: Computational Potential, Design, and Verification
• Randomized sampling for large zero-sum games
• Polynomial time decision algorithms for probabilistic automata
• Deterministic and stochastic P systems for modelling cellular processes
• A strand graph semantics for DNA-based computation
• Modular verification of chemical reaction network encodings via serializability analysis
• Abstract interpretation based verification of temporal properties for BioAmbients
• Synthesizing efficient systems in probabilistic environments
• State explosion in almost-sure probabilistic reachability
• Model checking and abstraction to the aid of parameterized systems (a survey)
• A computationally grounded, weighted doxastic logic
• A Symbolic Algorithm for Optimal Markov Chain Lumping
• Validation of Stochastic Systems
• The big-O problem
• Command-based importance sampling for statistical model checking
• Performance analysis of probabilistic timed automata using digital clocks
• Refining dynamics of gene regulatory networks in a stochastic \(\pi\)-calculus framework
• Model checking of biological systems
• Quantitative verification and strategy synthesis for stochastic games
• Concurrency and composition in a stochastic world
• Compositional probabilistic verification through multi-objective model checking
• On process rate semantics
• Model checking single agent behaviours by fluid approximation
• System design of stochastic models using robustness of temporal properties
• Automated technology for verification and analysis. 12th international symposium, ATVA 2014, Sydney, NSW, Australia, November 3--7, 2014. Proceedings
• Hybrid semantics for Bio-PEPA
• Model checking learning agent systems using Promela with embedded C code and abstraction
• Statistical probabilistic model checking with a focus on time-bounded properties
• Modelling, simulating and verifying Turing-powerful strand displacement systems
• Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
• Modular verification of DNA strand displacement networks via serializability analysis
• Semi-automated verification of security proofs of quantum cryptographic protocols
• Quantitative multi-objective verification for probabilistic systems
• AMYTISS
• Probabilistic model checking of complex biological pathways
• Synthesizing efficient controllers
• Model checking for probabilistic timed automata
• StocHy - automated verification and synthesis of stochastic processes
• Verification, Model Checking, and Abstract Interpretation
• Symbolic model checking for probabilistic timed automata
• A one-shot deviation principle for stability in matching problems
• Symbolic computation of differential equivalences
• A platform for high performance statistical model checking -- PLASMA
• Algebra and logic for resource-based systems modelling
• Dynamical Systems and Stochastic Programming: To Ordinary Differential Equations and Back
• Automatic verification of competitive stochastic systems
• QUASY: quantitative synthesis tool
• Analysing distributed internet worm attacks using continuous state-space approximation of process algebra models
• Automated verification and strategy synthesis for probabilistic systems
• Models of transcription factor binding: sensitivity of activation functions to model assumptions
• Using probabilistic model checking for dynamic power management
• Concavely-Priced Probabilistic Timed Automata
• Analysis of stochastic matching markets
• An overview of the mCRL2 toolset and its recent advances
• PRISM-games: a model checker for stochastic multi-player games
• CCMC: a conditional CSL model checker for continuous-time Markov chains
• Evaluating complex MAC protocols for sensor networks with APMC
• ExplicitPRISMSymm: symmetry reduction technique for explicit models in PRISM
• Marimba: a tool for verifying properties of hidden Markov models
• Rabinizer: small deterministic automata for \({\mathrm{LTL}(\mathrm{F},\mathrm{G})}\)
• Automatic verification of competitive stochastic systems
• Rabinizer 2: small deterministic automata for \(\mathrm{LTL}_{ \setminus\mathbf{GU}}\)
• Rabinizer 3: Safraless translation of LTL to small deterministic automata
• Pareto curves for probabilistic model checking
• RDA: a Coq library to reason about randomised distributed algorithms in the message passing model
• State of the Art in Logics for Verification of Resource-Bounded Multi-Agent Systems
• Probabilistic black-box reachability checking (extended version)
• A survey of timed automata for the development of real-time systems
• Three-valued abstraction for probabilistic systems
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Minimal counterexamples for linear-time probabilistic verification
• K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths
• Tools and algorithms for the construction and analysis of systems. 19th international conference, TACAS 2013, held as part of the European joint conferences on theory and practice of software, ETAPS 2013, Rome, Italy, March 16--24, 2013. Proceedings
• Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates
• Layered reasoning for randomized distributed algorithms
• Probabilistic approximations of ODEs based bio-pathway dynamics
• Synthesis and infeasibility analysis for stochastic models of biochemical systems using statistical model checking and abstraction refinement
• Cost preserving bisimulations for probabilistic automata
• Model checking usage policies

This page was built for software: PRISM