Deductive verification of invariants of state-transition systems

1998 ◽  
pp. 153-164
Author(s):  
Dieter Hutter
Keyword(s):  
State Transition ◽  
Deductive Verification ◽  
Transition Systems ◽  
State Transition Systems

State Transition Dynamics

2011 ◽  
pp. 32-55 ◽  
Author(s):  
Vincenzo Manca ◽  
Giuditta Franco ◽  
Giuseppe Scollo
Keyword(s):  
Dynamical Systems ◽  
State Transition ◽  
Molecular Computing ◽  
Discrete Models ◽  
Classical Dynamics ◽  
Transition Systems ◽  
Transition Dynamics ◽  
Models Of Computation ◽  
Simple Set ◽  
State Transition Systems

Classical dynamics concepts are analysed in the basic mathematical setting of state transition systems where time and space are both completely discrete and no structure is assumed on the state’s space. Interesting relationships between attractors and recurrence are identified and some features of chaos are expressed in simple, set theoretic terms. String dynamics is proposed as a unifying concept for dynamical systems arising from discrete models of computation, together with illustrative examples. The relevance of state transition systems and string dynamics is discussed from the perspective of molecular computing.

Analysing graph transformation systems through constraint handling rules

2010 ◽  
Vol 11 (1) ◽  
pp. 65-109 ◽  
Author(s):  
FRANK RAISER ◽  
THOM FRÜHWIRTH
Keyword(s):  
State Transition ◽  
Graph Transformation ◽  
Constraint Handling ◽  
Transition Systems ◽  
Rule Based ◽  
Program Equivalence ◽  
Transformation Systems ◽  
Graph Transformation Systems ◽  
State Transition Systems

AbstractGraph transformation systems (GTS) and constraint handling rules (CHR) are non-deterministic rule-based state transition systems. CHR is well known for its powerful confluence and program equivalence analyses, for which we provide the basis in this work to apply them to GTS. We give a sound and complete embedding of GTS in CHR, investigate confluence of an embedded GTS and provide a program equivalence analysis for GTS via the embedding. The results confirm the suitability of CHR-based program analyses for other formalisms embedded in CHR.

scholarly journals Adaptive Symbolic Control for Finite-State Transition Systems With Grammatical Inference

2014 ◽  
Vol 59 (2) ◽  
pp. 505-511 ◽  
Author(s):  
Jie Fu ◽  
Herbert G. Tanner ◽  
Jeffrey Heinz ◽  
Jane Chandlee
Keyword(s):  
State Transition ◽  
Grammatical Inference ◽  
Transition Systems ◽  
Symbolic Control ◽  
Finite State ◽  
State Transition Systems

Interactive visualization of state transition systems

2002 ◽  
Vol 8 (4) ◽  
pp. 319-329 ◽  
Author(s):  
F. van Ham ◽  
H. van de Wetering ◽  
J.J. van Wijk
Keyword(s):  
State Transition ◽  
Interactive Visualization ◽  
Transition Systems ◽  
State Transition Systems

Automatic Discovery of Fair Paths in Infinite-State Transition Systems

2021 ◽  
pp. 32-47
Author(s):  
Alessandro Cimatti ◽  
Alberto Griggio ◽  
Enrico Magnago
Keyword(s):  
State Transition ◽  
Transition Systems ◽  
Automatic Discovery ◽  
Infinite State ◽  
State Transition Systems
Sign in / Sign up

Export Citation Format

Share Document