Electronic proceedings in theoretical computer science, Apr 8, 2017
Hybrid systems are complex dynamical systems that combine discrete and continuous components. Rea... more Hybrid systems are complex dynamical systems that combine discrete and continuous components. Reachability questions, regarding whether a system can run into a certain subset of its state space, stand at the core of verification and synthesis problems for hybrid systems. This volume contains papers describing new developments in this area, which were presented at the 3rd International Workshop on Symbolic and Numerical Methods for Reachability Analysis.
Two approaches have been presented for the analysis of HPnGs, (i) a tree-based approach and (ii) ... more Two approaches have been presented for the analysis of HPnGs, (i) a tree-based approach and (ii) a state-space representation based on computational geometry. We present a translation of the tree-based representation into a geometric representation using the C++ library HyPro, which has been developed for the analysis of hybrid automata. This allows the representation and efficient and accurate analysis of HPnGs with multiple stochastic firings.
In this paper, we propose a new logic for expressing and reasoning about probabilistic hyperprope... more In this paper, we propose a new logic for expressing and reasoning about probabilistic hyperproperties. Hyperproperties characterize the relation between different independent executions of a system. Probabilistic hyperproperties express quantitative dependencies between such executions. The standard temporal logics for probabilistic systems, i.e., PCTL and PCTL * can refer only to a single path at a time and, hence, cannot express many probabilistic hyperproperties of interest. The logic proposed in this paper, HyperPCTL, adds explicit and simultaneous quantification over multiple traces to PCTL. Such quantification allows expressing probabilistic hyperproperties. A model checking algorithm for the proposed logic is also given for discrete-time Markov chains.
Electronic proceedings in theoretical computer science, Apr 8, 2017
Hybrid systems are complex dynamical systems that combine discrete and continuous components. Rea... more Hybrid systems are complex dynamical systems that combine discrete and continuous components. Reachability questions, regarding whether a system can run into a certain subset of its state space, stand at the core of verification and synthesis problems for hybrid systems. This volume contains papers describing new developments in this area, which were presented at the 3rd International Workshop on Symbolic and Numerical Methods for Reachability Analysis.
Two approaches have been presented for the analysis of HPnGs, (i) a tree-based approach and (ii) ... more Two approaches have been presented for the analysis of HPnGs, (i) a tree-based approach and (ii) a state-space representation based on computational geometry. We present a translation of the tree-based representation into a geometric representation using the C++ library HyPro, which has been developed for the analysis of hybrid automata. This allows the representation and efficient and accurate analysis of HPnGs with multiple stochastic firings.
In this paper, we propose a new logic for expressing and reasoning about probabilistic hyperprope... more In this paper, we propose a new logic for expressing and reasoning about probabilistic hyperproperties. Hyperproperties characterize the relation between different independent executions of a system. Probabilistic hyperproperties express quantitative dependencies between such executions. The standard temporal logics for probabilistic systems, i.e., PCTL and PCTL * can refer only to a single path at a time and, hence, cannot express many probabilistic hyperproperties of interest. The logic proposed in this paper, HyperPCTL, adds explicit and simultaneous quantification over multiple traces to PCTL. Such quantification allows expressing probabilistic hyperproperties. A model checking algorithm for the proposed logic is also given for discrete-time Markov chains.
Uploads
Papers by Erika Abraham