2,336 Hits in 10.1 sec

Model Checking Linear-Time Properties of Probabilistic Systems [chapter]

Christel Baier, Marcus Größer, Frank Ciesinski
2009 Monographs in Theoretical Computer Science  
Before explaining the ample set method, we briefly illustrate its impact on probabilistic linear-time model checking.  ...  Conclusion In this chapter, we have summarized the main features of Markov decision processes as an operational model for parallel probabilistic systems and model checking against ω-regular linear-time  ... 
doi:10.1007/978-3-642-01492-5_13 fatcat:n3qjkl2ojreypn7sxc4e7zfvs4

Model Checking Probabilistic Distributed Systems [chapter]

Benedikt Bollig, Martin Leucker
2003 Lecture Notes in Computer Science  
We introduce probabilistic product automata (PPA) as a natural model for this kind of systems. To reason about these systems, we propose to use a product version of linear temporal logic (LTL ⊗ ).  ...  The main result of the paper is a model-checking procedure for PPA and LTL ⊗ . With its help, it is possible to check qualitative properties of distributed systems automatically.  ...  Model checking, introduced independently in [CES83] and [QS82] , turned out to be one fruitful approach to automatically verify systems (see [CW96] for an overview of model checking in practice).  ... 
doi:10.1007/978-3-540-40965-6_19 fatcat:hxxc4l4n3jafladqs5ykh4mebe

MoChiBA: Probabilistic LTL Model Checking Using Limit-Deterministic Büchi Automata [chapter]

Salomon Sickert, Jan Křetínský
2016 Lecture Notes in Computer Science  
We present an extension of PRISM for LTL model checking of MDP using LDBA.  ...  As recently shown, a special subclass of limit-deterministic Büchi automata (LDBA) can replace deterministic Rabin automata in quantitative probabilistic model checking algorithms.  ...  This work is partially funded by the DFG Research Training Group "PUMA: Programm-und Modell-Analyse" (GRK 1480) and by the Czech Science Foundation, grant No. 15-17564S.  ... 
doi:10.1007/978-3-319-46520-3_9 fatcat:buvkajs4vvb7ze7gk4asxpcmeq

Monte Carlo Model Checking [chapter]

Radu Grosu, Scott A. Smolka
2005 Lecture Notes in Computer Science  
We present MC 2 , what we believe to be the first randomized, Monte Carlo algorithm for temporal-logic model checking.  ...  It does so in time O(MD) and space O(D), where D is B's recurrence diameter, using an optimal number of samples M .  ...  We are also grateful to the anonymous referees for their valuable comments.  ... 
doi:10.1007/978-3-540-31980-1_18 fatcat:me4gdoxzyrd2ng7dwsaibiron4

Linear-Time Model Checking Branching Processes [article]

Stefan Kiefer and Pavel Semukhin and Cas Widdershoven
2021 arXiv   pre-print
The underlying general model-checking algorithm is based on the automata-theoretic approach, using unambiguous B\"uchi automata.  ...  We study the complexity of model checking branching processes against linear-time omega-regular specifications: is it the case almost surely that every branch of a tree randomly generated by the branching  ...  Probabilistic linear-time model checking: An overview of the automata-theoretic approach. In Formal Methods for Real-Time and Probabilistic Systems, pages 265-276. Springer, 1999. 36 M.Y.  ... 
arXiv:2107.01687v1 fatcat:fxmzqdhdtnholcnkujs5wsfib4

Model Checking of Component Connectors

Mohammad Izadi, Ali Movaghar, Farhad Arbab
2007 Computer Software and Applications Conference (COMPSAC) Proceedings of the IEEE International  
Next we introduce the algorithm we implemented for model checking of Reo connectors. We follow an automata-based model checking approach.  ...  Recently, we have presented a set of results on timed Büchi automata of records and the model checking of the linear time properties [8] .  ... 
doi:10.1109/compsac.2007.153 dblp:conf/compsac/IzadiMA07 fatcat:lysriwrovfalxdsge5jm7xxuvi

Are Good-for-Games Automata Good for Probabilistic Model Checking? [chapter]

Joachim Klein, David Müller, Christel Baier, Sascha Klüppelholz
2014 Lecture Notes in Computer Science  
The potential double exponential blow-up for the generation of deterministic ω-automata for linear temporal logic formulas motivates research on weaker forms of determinism.  ...  One of these notions is the goodfor-games property that has been introduced by Henzinger and Piterman together with an algorithm for generating good-for-games automata from nondeterministic Büchi automata  ...  Also in the context of probabilistic model checking, the GFG-based approach turned out to be more time-and memoryconsuming than the traditional approach with deterministic automata.  ... 
doi:10.1007/978-3-319-04921-2_37 fatcat:ahxnyvpdhzb4pdq4d3dqyqkbai

Probabilistic Model Checking and Autonomy [article]

Marta Kwiatkowska, Gethin Norman, David Parker
2021 arXiv   pre-print
In this paper, we provide an overview of probabilistic model checking, focusing on models supported by the PRISM and PRISM-games model checkers.  ...  Probabilistic model checking is a technique to automatically verify, for a given temporal logic specification, that a system model satisfies the specification, as well as to synthesise an optimal strategy  ...  DISCLOSURE STATEMENT The authors are not aware of any affiliations, memberships, funding, or financial holdings that might be perceived as affecting the objectivity of this review. LITERATURE CITED  ... 
arXiv:2111.10630v1 fatcat:ckaniytpargkpcug52qvwgh3iy

UPPAAL-SMC: Statistical Model Checking for Priced Timed Automata

Peter Bulychev, Alexandre David, Kim Gulstrand Larsen, Marius Mikučionis, Danny Bøgsted Poulsen, Axel Legay, Zheng Wang
2012 Electronic Proceedings in Theoretical Computer Science  
In particular, uppaalsmc relies on a series of extensions of the statistical model checking approach generalized to handle real-time systems and estimate undecidable problems. uppaalsmc comes together  ...  This paper offers a survey of uppaalsmc, a major extension of the real-time verification tool uppaal. uppaalsmc allows for the efficient analysis of performance properties of networks of priced timed automata  ...  A Duration Probabilistic Automaton (DPA) is a composition of Simple Duration Probabilistic Automata (SDPA). An SDPA is a linear sequence of tasks that must be performed in a sequential order.  ... 
doi:10.4204/eptcs.85.1 fatcat:ta55esrh4baatbvz6zonadz4vm

Model Checking of Biological Systems [chapter]

Luboš Brim, Milan Češka, David Šafránek
2013 Lecture Notes in Computer Science  
We also give a brief account of high performance model checking techniques and add a few case studies that demonstrate the use of model checking in computational systems biology.  ...  We present a selection of approaches used for modeling biological systems and formalizing their interesting properties in temporal logics.  ...  for the exhaustive model checking approach.  ... 
doi:10.1007/978-3-642-38874-3_3 fatcat:gko33i5f6fe33jl4zi2cdte6ha

Learning deterministic probabilistic automata from a model checking perspective

Hua Mao, Yingke Chen, Manfred Jaeger, Thomas D. Nielsen, Kim G. Larsen, Brian Nielsen
2016 Machine Learning  
Abstract Probabilistic automata models play an important role in the formal design and analysis of hard-and software systems.  ...  We establish theoretical convergence properties for the learning algorithm as well as for probability estimates of system properties expressed in linear time temporal logic and linear continuous stochastic  ...  In: Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), pp 327-338 Vardi MY (1999) Probabilistic linear-time model checking: an overview of the automata-theoretic approach.  ... 
doi:10.1007/s10994-016-5565-9 fatcat:i3o46gz3irhkhlrf6fljayokky

Partial Order Methods for Statistical Model Checking and Simulation [chapter]

Jonathan Bogdoll, Luis María Ferrer Fioriti, Arnd Hartmanns, Holger Hermanns
2011 Lecture Notes in Computer Science  
We are grateful to Christel Baier (TU Dresden) for the initial inspiration to combine partial order methods with simulation and to Pedro R.  ...  Conclusion This paper has presented an on-the-fly, partial order reduction-based approach that enables statistical model checking and simulation of probabilistic automata with spurious nondeterminism arising  ...  Minea [17] for one approach and an overview of related work) rely on modified semantics or more restricted models or properties.  ... 
doi:10.1007/978-3-642-21461-5_4 fatcat:or3ctmrr45apbgbzkxllgpix4y

The mu-calculus and Model Checking [chapter]

Julian Bradfield, Igor Walukiewicz
2018 Handbook of Model Checking  
The mu-calculus is one of the most important logics in model-checking. It is a logic with an exceptional balance between expressiveness and algorithmic properties.  ...  This chapter presents a part of the theory of the mu-calculus that is relevant to the, broadly understood, model-checking problem.  ...  The section ends with an overview of approaches to the model-checking problem for the logic. Section 3 goes deeper into the theory of the mu-calculus.  ... 
doi:10.1007/978-3-319-10575-8_26 fatcat:7adhegoggvcjthaa5x5uhfpt24

Combined model checking for temporal, probabilistic, and real-time logics

Savas Konur, Michael Fisher, Sven Schewe
2013 Theoretical Computer Science  
However, the development of new model checking tools for complex combinations of logics is both difficult and time consuming.  ...  This avoids the reimplementation of model checking procedures.  ...  We would also like to thank Simon Dobson and Stephen Knox for providing the Scatterbox application and helpful discussions during the modelling of the system.  ... 
doi:10.1016/j.tcs.2013.07.012 fatcat:cjs5zxzwkrhoxh2qb7to7hevcy

Model checking with generalized Rabin and Fin-less automata

Vincent Bloemen, Alexandre Duret-Lutz, Jaco van de Pol
2019 International Journal on Software Tools for Technology Transfer (STTT)  
In the automata theoretic approach to explicit state LTL model checking, the synchronized product of the model and an automaton that represents the negated formula is checked for emptiness.  ...  We designed a multi-core TGRA checking algorithm and performed experiments on a subset of the models and formulas from the 2015 Model Checking Contest and generated LTL formulas for models from the BEEM  ...  Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecomm, which permits unrestricted use, distribution  ... 
doi:10.1007/s10009-019-00508-4 fatcat:gs6jxx3j7fdzzoqpz5kfgfcllu
« Previous Showing results 1 — 15 out of 2,336 results