PRISM

swMATH1186MaRDI QIDQ13928

No author found.

Related Items (only showing first 100 items - show all)

Parameter Synthesis Algorithms for Parametric Interval Markov Chains ⋮ Robust Control for Dynamical Systems with Non-Gaussian Noise via Formal Abstractions ⋮ Model Checking of Biological Systems ⋮ Checking Individual Agent Behaviours in Markov Population Models by Fluid Approximation ⋮ Tools and Algorithms for the Construction and Analysis of Systems ⋮ Unnamed Item ⋮ Computer Aided Verification ⋮ Validation of Stochastic Systems ⋮ Validation of Stochastic Systems ⋮ Validation of Stochastic Systems ⋮ PRISM-games: A Model Checker for Stochastic Multi-Player Games ⋮ An Overview of the mCRL2 Toolset and Its Recent Advances ⋮ Formal Modeling and Analysis of Timed Systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Designing reliable distributed systems. A formal methods approach based on executable modeling in Maude ⋮ Unnamed Item ⋮ A Probabilistic Extension of UML Statecharts ⋮ Theoretical Aspects of Computing – ICTAC 2005 ⋮ Theoretical Aspects of Computing – ICTAC 2005 ⋮ On the Complexity of Reachability in Parametric Markov Decision Processes ⋮ Theoretical Aspects of Computing - ICTAC 2004 ⋮ Spatial Calculus of Looping Sequences ⋮ Some Investigations Concerning the CTMC and the ODE Model Derived From Bio-PEPA ⋮ Approximating Probabilistic Behaviors of Biological Systems Using Abstract Interpretation ⋮ A Model and Analysis of the AKAP Scaffold ⋮ Relating PDEs in Cylindrical Coordinates and CTMCs with Levels of Concentration ⋮ Model Checking Kernel P Systems ⋮ Stochastic Bigraphs ⋮ Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking ⋮ Game-Based Probabilistic Predicate Abstraction in PRISM ⋮ Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations ⋮ Probabilistic Model Checking for Energy-Utility Analysis ⋮ Automated Technology for Verification and Analysis ⋮ Model checking usage policies ⋮ Approximate Verification of the Symbolic Dynamics of Markov Chains ⋮ Magnifying-Lens Abstraction for Markov Decision Processes ⋮ Computer aided verification. 13th international conference, CAV 2001, Paris, France, July 18--22, 2001. Proceedings ⋮ A Symbolic Algorithm for Optimal Markov Chain Lumping ⋮ Symbolic computation of differential equivalences ⋮ Verified analysis of random binary tree structures ⋮ Deterministic and stochastic P systems for modelling cellular processes ⋮ On simulation-based probabilistic model checking of mixed-analog circuits ⋮ A Hybrid Approach to Modeling Biological Systems ⋮ Cost Preserving Bisimulations for Probabilistic Automata ⋮ Model Checking-Based Genetic Programming with an Application to Mutual Exclusion ⋮ Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems ⋮ Symbolic computation of differential equivalences ⋮ Correct Hardware Design and Verification Methods ⋮ Types and typechecking for Communicating Quantum Processes ⋮ Verification, Model Checking, and Abstract Interpretation ⋮ Formal Methods in Computer-Aided Design ⋮ Tools and Algorithms for the Construction and Analysis of Systems ⋮ A Logical Framework for Systems Biology ⋮ Computing Cumulative Rewards Using Fast Adaptive Uniformization ⋮ Controller Synthesis for Reward Collecting Markov Processes in Continuous Space ⋮ Theorem proving graph grammars with attributes and negative application conditions ⋮ A counter abstraction technique for verifying properties of probabilistic swarm systems ⋮ Learning infinite-word automata with loop-index queries ⋮ From LTL to deterministic automata. A safraless compositional approach ⋮ Model checking and abstraction to the aid of parameterized systems (a survey) ⋮ Uniformization and hypergraph partitioning for the distributed computation of response time densities in very large Markov models ⋮ Symbolic model checking for probabilistic timed automata ⋮ Solving systems of bilinear equations for transition rate reconstruction ⋮ Trust evidence logic ⋮ Determinization and limit-determinization of Emerson-Lei automata ⋮ Automatic verification of concurrent stochastic systems ⋮ Value iteration for long-run average reward in Markov decision processes ⋮ Gradient-descent for randomized controllers under partial observability ⋮ Out of control: reducing probabilistic models by control-state elimination ⋮ Limited by sensing -- a minimal stochastic model of the lag-phase during diauxic growth ⋮ Precisely deciding CSL formulas through approximate model checking for CTMCs ⋮ Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes ⋮ Precise parameter synthesis for stochastic biochemical systems ⋮ Error bounds for stochastic shortest path problems ⋮ Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination ⋮ 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 ⋮ Communicating by compatibility ⋮ A formal approach to adaptive software: continuous assurance of non-functional requirements ⋮ Reo + \(\mathrm{mCRL2}\): a framework for model-checking dataflow in service compositions ⋮ Layered reasoning for randomized distributed algorithms ⋮ Reconciling real and stochastic time: the need for probabilistic refinement ⋮ Probabilistic verification of Herman's self-stabilisation algorithm ⋮ Three tokens in Herman's algorithm ⋮ Collaborative models for autonomous systems controller synthesis ⋮ PuRSUE -- from specification of robotic environments to synthesis of controllers ⋮ Abstract model repair for probabilistic systems ⋮ Formal verification and quantitative metrics of MPSoC data dynamics ⋮ Multi-cost bounded tradeoff analysis in MDP ⋮ Computing branching distances with quantitative games ⋮ Modeling fimbriae mediated parasite-host interactions ⋮ Local abstraction refinement for probabilistic timed programs ⋮ Optimal schedulers vs optimal bases: an approach for efficient exact solving of Markov decision processes ⋮ Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms ⋮ Hybrid semantics for Bio-PEPA ⋮ Multi-scale verification of distributed synchronisation ⋮ Exact quantitative probabilistic model checking through rational search ⋮ Verification and control for probabilistic hybrid automata with finite bisimulations

This page was built for software: PRISM