LiQuor

LiQuor is a tool for verifying probabilistic reactive systems modelled Probmela programs, which are terms of a probabilistic guarded command language with an operational semantics based on (finite) Markov decision processes. LiQuor provides the facility to perform a qualitative or quantitative analysis for omega-regular linear time properties by means of automata-based model checking algorithms


References in zbMATH (referenced in 17 articles )

Showing results 1 to 17 of 17.
Sorted by year (citations)

  1. Baier, Christel; de Alfaro, Luca; Forejt, Vojtěch; Kwiatkowska, Marta: Model checking probabilistic systems (2018)
  2. Biscaia, M.; Henriques, D.; Mateus, P.: Decidability of approximate Skolem problem and applications to logical verification of dynamical properties of Markov chains (2015)
  3. Giro, Sergio; D’Argenio, Pedro R.; Ferrer Fioriti, Luis María: Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms (2014)
  4. Wimmer, Ralf; Jansen, Nils; Ábrahám, Erika; Katoen, Joost-Pieter; Becker, Bernd: Minimal counterexamples for linear-time probabilistic verification (2014)
  5. Kiefer, Stefan; Murawski, Andrzej S.; Ouaknine, Joël; Wachter, Björn; Worrell, James: Algorithmic probabilistic game semantics. Playing games with automata (2013)
  6. Kwiatkowska, Marta; Norman, Gethin; Parker, David; Qu, Hongyang: Compositional probabilistic verification through multi-objective model checking (2013)
  7. Barbot, Beno^ıt; Haddad, Serge; Picaronny, Claudine: Coupling and importance sampling for statistical model checking (2012)
  8. Giro, Sergio; Rabe, Markus N.: Verification of partial-information probabilistic systems using counterexample-guided refinements (2012)
  9. Chen, Taolue; Han, Tingting; Katoen, Joost-Pieter; Mereacre, Alexandru: Observing continuous-time MDPs by 1-clock timed automata (2011)
  10. Delahaye, Beno{^ı}t; Caillaud, Beno{^ı}t; Legay, Axel: Probabilistic contracts: a compositional reasoning methodology for the design of systems with stochastic and/or non-deterministic aspects (2011)
  11. Jha, Sumit Kumar; Langmead, Christopher James: Synthesis and infeasibility analysis for stochastic models of biochemical systems using statistical model checking and abstraction refinement (2011)
  12. Clarke, Edmund; Donzé, Alexandre; Legay, Axel: On simulation-based probabilistic model checking of mixed-analog circuits (2010)
  13. Giro, Sergio: Undecidability results for distributed probabilistic systems (2009)
  14. Giro, Sergio; D’Argenio, Pedro R.; Ferrer Fioriti, Luis María: Partial order reduction for probabilistic systems: a revision for distributed schedulers (2009)
  15. Faella, Marco; Legay, Axel; Stoelinga, Mariëlle: Model checking quantitative linear time logic (2008)
  16. Kattenbelt, Mark; Kwiatkowska, Marta; Norman, Gethin; Parker, David: Game-based probabilistic predicate abstraction in PRISM (2008)
  17. Giro, Sergio; D’Argenio, Pedro R.: Quantitative model checking revisited: Neither decidable nor approximable (2007)