scholarly journals Development of Model Checker of Dynamic Linear Hybrid Automata

2013 ◽  
Author(s):  
Ryo Yanase ◽  
Tatsunori Sakai ◽  
Makoto Sakai ◽  
Satoshi Yamane
Keyword(s):  
Hybrid Automata ◽  
Model Checker ◽  
Linear Hybrid Automata

scholarly journals Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces

2012 ◽  
Vol 77 (10-11) ◽  
pp. 1122-1150 ◽  
Author(s):  
Werner Damm ◽  
Henning Dierks ◽  
Stefan Disch ◽  
Willem Hagemann ◽  
Florian Pigorsch ◽  
...  
Keyword(s):  
Hybrid Automata ◽  
State Spaces ◽  
Discrete State ◽  
Linear Hybrid Automata ◽  
Symbolic Verification

Learning Cycle-Linear Hybrid Automata for Excitable Cells

2007 ◽  
pp. 245-258 ◽  
Author(s):  
R. Grosu ◽  
S. Mitra ◽  
P. Ye ◽  
E. Entcheva ◽  
I. V. Ramakrishnan ◽  
...  
Keyword(s):  
Learning Cycle ◽  
Hybrid Automata ◽  
Excitable Cells ◽  
Linear Hybrid Automata

Deriving Unbounded Reachability Proof of Linear Hybrid Automata during Bounded Checking Procedure

2017 ◽  
Vol 66 (3) ◽  
pp. 416-430 ◽  
Author(s):  
Dingbao Xie ◽  
Wen Xiong ◽  
Lei Bu ◽  
Xuandong Li
Keyword(s):  
Hybrid Automata ◽  
Linear Hybrid Automata ◽  
Checking Procedure

scholarly journals Representing hybrid automata by action language modulo theories

2017 ◽  
Vol 17 (5-6) ◽  
pp. 924-941 ◽  
Author(s):  
JOOHYUNG LEE ◽  
NIKHIL LONEY ◽  
YUNSONG MENG
Keyword(s):  
Differential Equations ◽  
Ordinary Differential Equations ◽  
Satisfiability Modulo Theories ◽  
Prototype System ◽  
Hybrid Automata ◽  
Action Languages ◽  
Smt Solver ◽  
Action Language ◽  
Linear Hybrid Automata ◽  
Answer Set

AbstractBoth hybrid automata and action languages are formalisms for describing the evolution of dynamic systems. This paper establishes a formal relationship between them. We show how to succinctly represent hybrid automata in an action language which in turn is defined as a high-level notation for answer set programming modulo theories—an extension of answer set programs to the first-order level similar to the way satisfiability modulo theories (SMT) extends propositional satisfiability (SAT). We first show how to represent linear hybrid automata with convex invariants by an action language modulo theories. A further translation into SMT allows for computing them using SMT solvers that support arithmetic over reals. Next, we extend the representation to the general class of non-linear hybrid automata allowing even non-convex invariants. We represent them by an action language modulo ordinary differential equations, which can be compiled into satisfiability modulo ordinary differential equations. We present a prototype systemcplus2aspmtbased on these translations, which allows for a succinct representation of hybrid transition systems that can be computed effectively by the state-of-the-art SMT solverdReal.

Sign in / Sign up

Export Citation Format

Share Document