Filters








5,921 Hits in 4.0 sec

Symbolic Model Checking for Probabilistic Timed Automata [chapter]

Marta Kwiatkowska, Gethin Norman, Jeremy Sproston, Fuzhi Wang
2004 Lecture Notes in Computer Science  
We present symbolic model checking algorithms for probabilistic timed automata to verify qualitative properties, corresponding to satisfaction with probability 0 or 1, as well as quantitative properties  ...  The paper completes the symbolic framework for the verification of probabilistic timed automata against full PTCTL.  ...  Conclusions We have presented the theoretical foundations for the symbolic model-checking of probabilistic timed automata and PTCTL.  ... 
doi:10.1007/978-3-540-30206-3_21 fatcat:dcl2ojckfne7nhrohj5hpogydq

Symbolic model checking for probabilistic timed automata

Marta Kwiatkowska, Gethin Norman, Jeremy Sproston, Fuzhi Wang
2007 Information and Computation  
We present symbolic model-checking algorithms for probabilistic timed automata to verify both qualitative temporal logic properties, corresponding to satisfaction with probability 0 or 1, and quantitative  ...  The paper presents a symbolic framework for the verification of probabilistic timed automata against the probabilistic, timed temporal logic PTCTL.  ...  Conclusions We have presented the theoretical foundations for the symbolic model checking of probabilistic timed automata and PTCTL and validated them through a prototype implementation using DBMs.  ... 
doi:10.1016/j.ic.2007.01.004 fatcat:kcnusotclfajpd5k47vgmakutu

Symbolic Reachability Analysis of Probabilistic Linear Hybrid Automata

Y. MUTSUDA
2005 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences  
For the purpose of system verification, we formally define probabilistic linear hybrid automaton and its symbolic reachability analysis method.  ...  We can model embedded systems as hybrid systems. Moreover, they are distributed and real-time systems. Therefore, it is important to specify and verify randomness and soft real-time properties.  ...  For probabilistic timed automata [4] , zone-based symbolic model checking algorithms and tool PRISM have been presented [3] . 3.  ... 
doi:10.1093/ietfec/e88-a.11.2972 fatcat:tok2g4ebincititpg4jwfqvumu

PRISM 4.0: Verification of Probabilistic Real-Time Systems [chapter]

Marta Kwiatkowska, Gethin Norman, David Parker
2011 Lecture Notes in Computer Science  
This paper describes a major new release of the PRISM probabilistic model checker, adding, in particular, quantitative verification of (priced) probabilistic timed automata.  ...  These include: an extensible toolkit for building, verifying and refining abstractions of probabilistic models; an explicit-state probabilistic model checking library; a discrete-event simulation engine  ...  For a full list of PRISM contributors, see [16].  ... 
doi:10.1007/978-3-642-22110-1_47 fatcat:y6aqczsj3fhtrcwwwljw5iqqki

Model-checking branching-time properties of probabilistic automata and probabilistic one-counter automata [article]

T. Lin
2021 arXiv   pre-print
And then, for each probabilistic automata, by constructing a probabilistic one-counter automaton with the same behavior as questioned probabilistic automata the undecidability of model-checking problems  ...  This paper studies the problem of model-checking of probabilistic automaton and probabilistic one-counter automata against probabilistic branching-time temporal logics (PCTL and PCTL^*).  ...  Introduction This paper presents an analysis of model-checking probabilistic branching-time properties of probabilistic automata, in order to study the problem of model-checking probabilistic one-counter  ... 
arXiv:1502.07549v2 fatcat:zmyi6hugozdhza3y7blvnu5lyy

Preface to the special issue on Probabilistic Model Checking

Christel Baier, Marta Kwiatkowska
2013 Formal methods in system design  
Probabilistic model checking aims to achieve automated analysis of probabilistic models against specifications given in temporal logic, and involves an intricate combination of conventional model checking  ...  Baier and Kwiatkowska [1], for both branching-and linear-time variants of temporal logic, along with the first prototype tools.  ...  In [13] , a tutorial-style overview is given for model checking of probabilistic timed automata, which arise as conventional timed automata extended with discrete probability distributions to model transitions  ... 
doi:10.1007/s10703-013-0194-4 fatcat:neeu3chulzhtthtdlvatjawmxy

Probabilistic Model Checking of Contention Resolution in the IEEE 802.15.4 Low-Rate Wireless Personal Area Network Protocol

Matthias Fruth
2006 Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (isola 2006)  
We model the protocol using probabilistic timed automata, a formalism in which both nondeterministic and probabilistic choice can be represented.  ...  in IEEE 802.3 for Ethernet and IEEE 802.11 for Wireless LAN.  ...  ACKNOWLEDGEMENTS The author would like to thank Marta Kwiatkowska, Gethin Norman, Dave Parker, and the anonymous referees for many valuable comments and suggestions.  ... 
doi:10.1109/isola.2006.34 dblp:conf/isola/Fruth06 fatcat:cvo7y4osufcvxja6g4fg4gc4ji

An MTBDD-Based Implementation of Forward Reachability for Probabilistic Timed Automata [chapter]

Fuzhi Wang, Marta Kwiatkowska
2005 Lecture Notes in Computer Science  
In this paper we propose an encoding method for Probabilistic Timed Automata (PTA) based on MTBDDs.  ...  Multi-Terminal Binary Decision Diagrams (MTBDDs) have been successfully applied in symbolic model checking of probabilistic systems.  ...  We would like to thank the authors of the DDD library for letting us use their DDD implementation. We would also like to thank Gethin Norman and David Parker for helpful discussion.  ... 
doi:10.1007/11562948_29 fatcat:3mauljrh3jgw5k65z6kzo4fx6m

Probabilistic Model Checking of Deadline Properties in the IEEE 1394 FireWire Root Contention Protocol

Marta Kwiatkowska, Gethin Norman, Jeremy Sproston
2003 Formal Aspects of Computing  
Probabilistic timed automata are used to formally model and verify the protocol against properties which require that a leader is elected before a deadline with a certain probability.  ...  We present a formal verification of the protocol using probabilistic model checking. Rather than analyze the functional aspects of the protocol, by asking such questions as "will a leader be elected?"  ...  applied to improve the efficiency of probabilistic timed automata model checking.  ... 
doi:10.1007/s001650300007 fatcat:j44aupeidjbfdexwe3eaxlzrsm

Model Checking Probabilistic Real-Time Properties for Service-Oriented Systems with Service Level Agreements

Christian Krause, Holger Giese
2011 Electronic Proceedings in Theoretical Computer Science  
In this paper, we suggest to employ the recently introduced model of Interval Probabilistic Timed Automata (IPTA) for formal verification of QoS properties of service-oriented systems.  ...  Specifically, we show that IPTA in contrast to Probabilistic Timed Automata (PTA) are able to capture the guarantees specified in SLAs directly.  ...  Acknowledgments The authors of this paper are grateful to Dave Parker for his support with the IPTA implementation in PRISM.  ... 
doi:10.4204/eptcs.73.8 fatcat:vgvwm6k7yza7vmrtr2yvrxgddq

Symbolic Computation of Maximal Probabilisti Reachability [chapter]

Marta Kwiatkowska, Gethin Norman, Jeremy Sproston
2001 Lecture Notes in Computer Science  
to obtain a model for an infinite-state probabilistic system called a symbolic probabilistic system.  ...  We illustrate our approach with examples of probabilistic timed automata, for which previous approaches to this reachability problem were either based on unnecessarily fine subdivisions of the state space  ...  obtained as a semantical model for probabilistic timed automata in the standard manner [15] .  ... 
doi:10.1007/3-540-44685-0_12 fatcat:pwmnsjbtnzc4venxbjbceqoxae

$$2^5$$ Years of Model Checking [chapter]

Edmund M. Clarke, Qinsi Wang
2015 Lecture Notes in Computer Science  
Model Checking is an automatic verification technique for large state transition systems. It was originally developed for reasoning about finite-state concurrent systems.  ...  Model Checking and State Explosion Problem Model Checking, as a framework consisting of powerful techniques for verifying finite-state systems, was independently developed by Clarke and Emerson [22] and  ...  For a decidable subclass which is called probabilistic initialized rectangular automata (PIRAs), Sproston offered a model checking procedure against the probabilistic branching time logic (PBTL) [56]  ... 
doi:10.1007/978-3-662-46823-4_2 fatcat:g4tbd7fribgothf2bfgajkywfe

Modeling time series of climatic parameters with probabilistic finite automata

L. Mora-López, J. Mora, R. Morales-Bueno, M. Sidrach-de-Cardona
2005 Environmental Modelling & Software  
This model includes the following three steps: dynamic discretization of continuous values, construction of probabilistic finite automata and prediction of new series with randomness.  ...  A model to characterize and predict continuous time series from machine-learning techniques is proposed.  ...  For instance, acyclic probabilistic finite automata have been used for modeling distributions on short sequences (Ron et al., 1998) ; probabilistic suffix automata, based on variable order Markov models  ... 
doi:10.1016/j.envsoft.2004.04.007 fatcat:iqlr4vhc5falnnhxnpgk5vqmke

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

Salomon Sickert, Jan Křetínský
2016 Lecture Notes in Computer Science  
As recently shown, a special subclass of limit-deterministic Büchi automata (LDBA) can replace deterministic Rabin automata in quantitative probabilistic model checking algorithms.  ...  We present an extension of PRISM for LTL model checking of MDP using LDBA.  ...  The authors want to thank Ernst Moritz Hahn and Andrea Turrini for providing a private version of IscasMC to compare to and for assistance in using it.  ... 
doi:10.1007/978-3-319-46520-3_9 fatcat:buvkajs4vvb7ze7gk4asxpcmeq

Probabilistic and Topological Semantics for Timed Automata [chapter]

Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer
2007 Lecture Notes in Computer Science  
Like most models used in model-checking, timed automata are an idealized mathematical model used for representing systems with strong timing requirements.  ...  Timed automata are an idealized mathematical model, in which several assumptions are implicitely made: it has infinite precision, instantaneous events, etc.  ...  For both semantics, we can naturally address a model-checking problem for LTL: almost-sure model-checking for the probabilistic case and fair model-checking for the topological case.  ... 
doi:10.1007/978-3-540-77050-3_15 fatcat:hhvbzkyxzrdd7kibtkb4pdwzey
« Previous Showing results 1 — 15 out of 5,921 results