Technique and tool for symbolic representation and manipulation of stochastic transition systems

2002 ◽  
Author(s):  
M. Siegle
Keyword(s):  
Symbolic Representation ◽  
Transition Systems ◽  
Stochastic Transition

scholarly journals When are stochastic transition systems tameable?

2018 ◽  
Vol 99 ◽  
pp. 41-96 ◽  
Author(s):  
Nathalie Bertrand ◽  
Patricia Bouyer ◽  
Thomas Brihaye ◽  
Pierre Carlier
Keyword(s):  
Transition Systems ◽  
Stochastic Transition

scholarly journals SMT for state-based formal methods: the ASM case study

10.29007/djdz ◽  
2018 ◽  
Author(s):  
Paolo Arcaini ◽  
Angelo Gargantini ◽  
Elvinia Riccobene
Keyword(s):  
Computational Model ◽  
Symbolic Representation ◽  
Transition System ◽  
Explicit Representation ◽  
State Machines ◽  
Transition Systems ◽  
Smt Solver ◽  
Finite State ◽  
Satisfiability Checking

State-based transition systems can take advantage of a symbolic representation of the concepts of state and transition in order to automatically solve verification questions that could not be otherwise tackled in terms of explicit representation of the transition system. We report here our experience in developing solutions, approaches and supporting tools of verification problems regarding the Abstract State Machines (ASMs), a transition system which can be considered as an extension of Finite State Machines. We present the symbolic representation of an ASM and of its computational model in terms of the Yices SMT solver. We also discuss two scenarios of verification questions regarding the ASMs for which the symbolic representation helped us to formalize and solve the problem by satisfiability checking, namely automatic proof of correct ASM refinement and runtime verification.

Sign in / Sign up

Export Citation Format

Share Document