HAT: Analyzing Linear Hybrid Automata as Labelled Transition System

2018 ◽  
pp. 85-104
Author(s):  
Lei Bu ◽  
Hui Jiang ◽  
Xin Chen ◽  
Enyi Tang ◽  
Xuandong Li
Keyword(s):  
Transition System ◽  
Hybrid Automata ◽  
Linear Hybrid Automata ◽  
Labelled Transition System

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

scholarly journals Study on Formal Modeling and Safety Verification of Train-to-Train Communication

2018 ◽  
Vol 2018 ◽  
pp. 1-9
Author(s):  
Haonan Feng
Keyword(s):  
Transition System ◽  
Research Trend ◽  
Safety Properties ◽  
Safety Verification ◽  
Critical System ◽  
Real Time System ◽  
Vehicle Communication ◽  
Train Control ◽  
Safety Critical System ◽  
Labelled Transition System

VBTC (vehicle-to-vehicle communication based train control) has gradually become an important research trend in the field of rail transit. This has resulted in advantages of decreasing the number of pieces of wayside equipment and improving the efficiency of real-time system communication. Characteristics and mechanism of train-to-train communication, as key implementation technology of safety critical system, are given and discussed. A new method, based on the LTS (labelled transition system) model checking, is proposed for verifying the safety properties in the communication procedure. The LTS method is adapted to model system behaviours; analysis and safety verification are checked by means of LTSA (labelled transition system analyzer) software. The results show that it is an efficient method to verify safety properties, as well as to assist the complex system’s design and development.

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

Target-oriented Petri Net Synthesis

2020 ◽  
Author(s):  
Eike Best ◽  
Raymond Devillers ◽  
Evgeny Erofeev ◽  
Harro Wimmel
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Transition System ◽  
Efficient Synthesis ◽  
Transition Systems ◽  
Np Complete ◽  
Full Class ◽  
Petri Net Synthesis ◽  
Labelled Transition System ◽  
Additional Constraints

When a Petri net is synthesised from a labelled transition system, it is frequently desirable that certain additional constraints are fulfilled. For example, in circuit design, one is often interested in constructing safe Petri nets. Targeting such subclasses of Petri nets is not necessarily computationally more efficient than targeting the whole class. For example, targeting safe nets is known to be NP-complete while targeting the full class of place/transition nets is polynomial, in the size of the transition system. In this paper, several classes of Petri nets are examined, and their suitability for being targeted through efficient synthesis from labelled transition systems is studied and assessed. The focus is on choice-free Petri nets and some of their subclasses. It is described how they can be synthesised efficiently from persistent transition systems, summarising and streamlining in tutorial style some of the authors’ and their groups’ work over the past few years.

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
Sign in / Sign up

Export Citation Format

Share Document