Symbolic execution of UML-RT State Machines

2012 ◽  
Author(s):  
Karolina Zurowska ◽  
Juergen Dingel
Keyword(s):  
Symbolic Execution ◽  
State Machines

scholarly journals Integration of Symbolic Execution into a Formal Abstract State Machines based Language

2017 ◽  
Vol 50 (1) ◽  
pp. 11251-11256
Author(s):  
Vladimir-Alexandru Paun ◽  
Bruno Monsuez ◽  
Philippe Baufreton
Keyword(s):  
Symbolic Execution ◽  
State Machines ◽  
Abstract State Machines

ERROR LOCALIZATION DIAGNOSTIC MODEL OPTIMIZATION IN DIGITAL STATE MACHINES NETWORKS

2019 ◽  
Author(s):  
Irina Bystrova ◽  
E. Danil'chuk ◽  
Boris Podkopaev
Keyword(s):  
Single Component ◽  
Diagnostic Model ◽  
State Machines ◽  
Model Optimization ◽  
Error Localization ◽  
Diagnostic Models

The problem of constructing a diagnostic model for a network S consisting of a number of digital automata is considered, provided that the diagnostic models of all network components are known. It is assumed that these models are given by systems of logical equations, and the errors to be detected are localized in any but a single component of the network.

Information mechanics

2017 ◽  
Author(s):  
Sandip Tiwari
Keyword(s):  
Information Flow ◽  
Irreversible Processes ◽  
State Machines ◽  
Science And Engineering ◽  
Von Neumann ◽  
Principle Of Maximum Entropy ◽  
Information Manipulation ◽  
Classical Quantum ◽  
Physical Laws ◽  
Principle Of Maximum

Information is physical, so its manipulation through devices is subject to its own mechanics: the science and engineering of behavioral description, which is intermingled with classical, quantum and statistical mechanics principles. This chapter is a unification of these principles and physical laws with their implications for nanoscale. Ideas of state machines, Church-Turing thesis and its embodiment in various state machines, probabilities, Bayesian principles and entropy in its various forms (Shannon, Boltzmann, von Neumann, algorithmic) with an eye on the principle of maximum entropy as an information manipulation tool. Notions of conservation and non-conservation are applied to example circuit forms folding in adiabatic, isothermal, reversible and irreversible processes. This brings out implications of fluctuation and transitions, the interplay of errors and stability and the energy cost of determinism. It concludes discussing networks as tools to understand information flow and decision making and with an introduction to entanglement in quantum computing.

Sign in / Sign up

Export Citation Format

Share Document