Filters








97,693 Hits in 3.7 sec

Accelerating Parametric Probabilistic Verification [article]

Nils Jansen and Florian Corzilius and Matthias Volk and Ralf Wimmer and Erika Ábrahám and Joost-Pieter Katoen and Bernd Becker
2014 arXiv   pre-print
We present a novel method for computing reachability probabilities of parametric discrete-time Markov chains whose transition probabilities are fractions of polynomials over a set of parameters.  ...  Introduction Discrete-time Markov chains (DTMCs) are a widely used modeling formalism for systems exhibiting probabilistic behavior.  ...  Conclusion and Future Work We presented a new approach to verify parametric Markov chains together with an improved factorization of polynomials.  ... 
arXiv:1312.3979v3 fatcat:hlfsrxqqlbc23jpszwv6zqtoou

Parametric Verification of Weighted Systems

Peter Christoffersen, Mikkel Hansen, Anders Mariegaard, Julian Trier Ringsmose, Kim Guldstrand Larsen, Radu Mardare, Marc Herbstritt
2015 International Workshop on Synthesis of Complex Parameters  
To address this problem, we use parametric dependency graphs (PDGs) and we propose a global update function that yields an assignment to each node in a PDG.  ...  ACM Subject Classification D.2.4 Software/Program Verification  ...  In addition to the theoretical work of this paper, we have implemented a prototype tool (PVTool) that computes the fixed point for verification of parametric properties on parametric models.  ... 
doi:10.4230/oasics.syncop.2015.77 dblp:conf/syncop/ChristoffersenH15 fatcat:kjtmkbgccfferodf2vpomr2th4

Parametric Systems: Verification and Synthesis [article]

Viorica Sofronie-Stokkermans
2019 arXiv   pre-print
In this paper we study possibilities of using hierarchical reasoning, symbol elimination and model generation for the verification of parametric systems, where the parameters can be constants or functions  ...  We thank Werner Damm for helpful discussions on the verification of hybrid automata, and Mȃdȃlina Eraşcu for performing quantifier elimination for the examples from [29] using Mathematica, Redlog and  ...  Introduction Most of the applications in verification require reasoning about complex domains.  ... 
arXiv:1910.05208v1 fatcat:qk2grujeabbpzgwm5rtv4u42da

Verification of parametric sources of entanglement

Maria Bondani, Matteo G A Paris
2002 Journal of Optics B-Quantum and Semiclassical Optics  
We suggest a novel scheme for the verification of parametric entanglement sources.  ...  An experimental setup to implement the verification in the low-gain regime by photodetection is analysed in some detail.  ...  This nonclassicality is present only when the beams are entangled, such that its verification corresponds to the verification of the parametric source.  ... 
doi:10.1088/1464-4266/4/4/333 fatcat:ohy2kpeiznhyvjgdbmxpbm6gu4

Verification by Parallelization of Parametric Code [chapter]

Tobias Gedell, Reiner Hähnle
2007 Lecture Notes in Computer Science  
This paper is an extended and revised version of [13] .  ...  The method has been implemented in the KeY verification tool.  ...  Obviously, verification by parallelization of parametric code is an incomplete verification technique for loops, because not all loops are parallelizable.  ... 
doi:10.1007/978-3-540-75939-3_10 fatcat:r4w2xo5jezey7o4wwm7ghv6ke4

Parametric Verification of Address Space Separation [chapter]

Jason Franklin, Sagar Chaki, Anupam Datta, Jonathan M. McCune, Amit Vasudevan
2012 Lecture Notes in Computer Science  
We address this problem by developing a sound and complete parametric verification technique that achieves the best possible reduction in model size.  ...  Address Space Translation and Separation In this section, we give an overview of the systems we target, viz., address space translation schemes, and the properties we verify, viz., address separation.  ...  We developed a parametric verification technique to address this challenge. Our approach involves a new modeling language and specification mechanism to model and verify such parametric systems.  ... 
doi:10.1007/978-3-642-28641-4_4 fatcat:7xgedlnnzfcdppzqvt6foa7g5q

Handling Global Conditions in Parametrized System Verification [chapter]

Parosh Aziz Abdulla, Ahmed Bouajjani, Bengt Jonsson, Marcus Nilsson
1999 Lecture Notes in Computer Science  
We perform verification using a standard symbolic reachability algorithm enhanced by an operation to accelerate the search of the state space.  ...  We consider symbolic verification for a class of parameterized systems, where a system consists of a linear array of processes, and where an action of a process may in general be guarded by both local  ...  Introduction Much attention has recently been paid to extending the applicability of model checking to infinite-state systems.  ... 
doi:10.1007/3-540-48683-6_14 fatcat:pz3q3cho5bd77dvnb2azku2izq

On parametrized verification of asynchronous, shared-memory pushdown systems [article]

Marie Fortin, Anca Muscholl, Igor Walukiewicz
2016 arXiv   pre-print
We consider the model of parametrized asynchronous shared-memory pushdown systems, as introduced in [Hague'11].  ...  Finally, we should mention that there is a rich literature concerning the verification of asynchronously-communicating parametrized programs, that is mostly related to the verification of distributed protocols  ...  Parametrized verification of shared-memory, multi-threaded programs has been studied for finite-state threads e.g. in [2, 17] and for pushdown threads in [1, 5, 19, 20] .  ... 
arXiv:1606.08707v2 fatcat:ekk5kg7w2zdptlcpamafzyl45i

Scenario-Based Verification of Uncertain Parametric MDPs [article]

Thom S. Badings, Murat Cubuktepe, Nils Jansen, Sebastian Junges, Joost-Pieter Katoen, Ufuk Topcu
2021 arXiv   pre-print
We consider parametric Markov decision processes (pMDPs) that are augmented with unknown probability distributions over parameter values.  ...  Scenario-Based Verification of Uncertain Parametric MDPs 13 egy synthesis problem as an (undecidable [18]) partially 2.  ...  Sutton, R.S., Barto, A.G.: Reinforcement Learning: An 33. Hatefi, H., Hermanns, H.: Model Checking Algorithms for Introduction. MIT Press (2018) Markov Automata.  ... 
arXiv:2112.13020v1 fatcat:g7karwsgpnaxrbtcj3lem5s5ke

Parametric Verification of a Group Membership Algorithm [article]

Ahmed Bouajjani, Agathe Merceron
2005 arXiv   pre-print
In this paper, we propose an automatic verification method for an arbitrary number of stations N and a given number of faults k.  ...  We give an abstraction that allows to model the algorithm by means of unbounded (parametric) counter automata.  ...  Introduction The verification of complex systems, especially of software systems, requires the adoption of powerful methodologies based on combining, and sometimes iterating, several analysis techniques  ... 
arXiv:cs/0505033v1 fatcat:w6ywgvfs2ve5zmwlv525spsyxu

Parametric Verification of a Group Membership Algorithm

AHMED BOUAJJANI, AGATHE MERCERON
2006 Theory and Practice of Logic Programming  
In this paper, we propose an automatic verification method for an arbitrary number of stations N and a given number of faults k.  ...  We give a faithful abstraction that allows to model the algorithm by means of unbounded (parametric) counter automata.  ...  [6, 15] consider the parametric verification of n stations; [15] provides an abstraction proved manually whereas [6] uses an automatic abstraction generation technique, both abstractions leading  ... 
doi:10.1017/s1471068406002663 fatcat:su7wteal3jh5ja5examyg47bh4

Parametric Verification of a Group Membership Algorithm [chapter]

Ahmed Bouajjani, Agathe Merceron
2002 Lecture Notes in Computer Science  
In this paper, we propose an automatic verification method for an arbitrary number of stations N and a given number of faults k.  ...  We give a faithful abstraction that allows to model the algorithm by means of unbounded (parametric) counter automata.  ...  [6, 15] consider the parametric verification of n stations; [15] provides an abstraction proved manually whereas [6] uses an automatic abstraction generation technique, both abstractions leading  ... 
doi:10.1007/3-540-45739-9_19 fatcat:jtuqr2zszfdhpfcmwyp2p5pp5m

Incremental Verification of Parametric and Reconfigurable Markov Chains [article]

Paul Gainer, Ernst Moritz Hahn, Sven Schewe
2018 arXiv   pre-print
The analysis of parametrised systems is a growing field in verification, but the analysis of parametrised probabilistic systems is still in its infancy.  ...  The unicorn would be an automatic transformation of a parametrised system into a formula, which allows to plot, say, the likelihood to reach a goal or the expected costs to do so, against the parameters  ...  Acknowledgements This work was supported by the Sir Joseph Rotblat Alumni Scholarship at Liverpool, EPSRC grants EP/M027287/1 and EP/N007565/1, and by the Marie Sk lodowska Curie Fellowship Parametrised Verification  ... 
arXiv:1804.01872v1 fatcat:e45dkh5r6ngideszwks2gvtase

Hybrid Dynamical Systems: An Introduction to Control and Verification

Lin Hai
2014 Foundations and Trends® in Systems and Control  
These are verification problems.  ...  Deductive verification methods for hybrid system verification are also being developed in the literature.  ... 
doi:10.1561/2600000001 fatcat:kxr4yc3rjzet7kwzz7pcm6a2ri

Automatic Verification of Parametric Specifications with Complex Topologies [chapter]

Johannes Faber, Carsten Ihlemann, Swen Jacobs, Viorica Sofronie-Stokkermans
2010 Lecture Notes in Computer Science  
The focus of this paper is on reducing the complexity in verification by exploiting modularity at various levels: in specification, in verification, and structurally.  ...  At the verification level, we exploit modularity in theorem proving for rich data structures and use this for invariant checking.  ...  Introduction Parametric real-time systems arise in a natural way in a wide range of applications, including controllers for systems of cars, trains, and planes.  ... 
doi:10.1007/978-3-642-16265-7_12 fatcat:b3o57vbfyrgytio2nbzblmp53m
« Previous Showing results 1 — 15 out of 97,693 results