scholarly journals Abstraction, Refinement and Proof for Probabilistic Systems

2005 ◽  
Keyword(s):  
Abstraction Refinement ◽  
Probabilistic Systems

scholarly journals Assume-Guarantee Abstraction Refinement for Probabilistic Systems

2012 ◽  
pp. 310-326 ◽  
Author(s):  
Anvesh Komuravelli ◽  
Corina S. Păsăreanu ◽  
Edmund M. Clarke
Keyword(s):  
Abstraction Refinement ◽  
Probabilistic Systems

Abstraction and refinement in probabilistic systems

2005 ◽  
Vol 32 (4) ◽  
pp. 41-47 ◽  
Author(s):  
Annabelle McIver ◽  
Carroll Morgan
Keyword(s):  
Probabilistic Systems

scholarly journals Configurable verification of timed automata with discrete variables

2020 ◽  
Author(s):  
Tamás Tóth ◽  
István Majzik
Keyword(s):  
Timed Automata ◽  
Empirical Evaluation ◽  
Real Time Systems ◽  
Discrete Variables ◽  
Reachability Problem ◽  
Abstraction Refinement ◽  
Dependent Behavior ◽  
Wide Range ◽  
Time Systems ◽  
Lazy Abstraction

AbstractAlgorithms and protocols with time dependent behavior are often specified formally using timed automata. For practical real-time systems, besides real-valued clock variables, these specifications typically contain discrete data variables with nontrivial data flow. In this paper, we propose a configurable lazy abstraction framework for the location reachability problem of timed automata that potentially contain discrete variables. Moreover, based on our previous work, we uniformly formalize in our framework several abstraction refinement strategies for both clock and discrete variables that can be freely combined, resulting in many distinct algorithm configurations. Besides the proposed refinement strategies, the configurability of the framework allows the integration of existing efficient lazy abstraction algorithms for clock variables based on $${\textit{LU}}$$ LU -bounds. We demonstrate the applicability of the framework and the proposed refinement strategies by an empirical evaluation on a wide range of timed automata models, including ones that contain discrete variables or diagonal constraints.

scholarly journals Branching bisimulation congruence for probabilistic systems

2012 ◽  
Vol 413 (1) ◽  
pp. 58-72 ◽  
Author(s):  
Suzana Andova ◽  
Sonja Georgievska ◽  
Nikola Trčka
Keyword(s):  
Probabilistic Systems ◽  
Branching Bisimulation

scholarly journals A logical duality for underspecified probabilistic systems

2011 ◽  
Vol 209 (5) ◽  
pp. 850-871 ◽  
Author(s):  
Josée Desharnais ◽  
François Laviolette ◽  
Amélie Turgeon
Keyword(s):  
Probabilistic Systems
Sign in / Sign up

Export Citation Format

Share Document