Verification of systems with behavior parallelism on the basis of the graph of reachable states
Considered problem of model based verification of control systems is the checking whether the system behavior satisfies the requirements fixed in the design specification The testing includes the experiments consisting in simulation of investigated system to see input-output correspondence to the mo...
Saved in:
| Main Authors: | Yu. V. Pottosin, V. I. Romanov, L. D. Cheremisinova |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
National Academy of Sciences of Belarus, the United Institute of Informatics Problems
2019-06-01
|
| Series: | Informatika |
| Subjects: | |
| Online Access: | https://inf.grid.by/jour/article/view/584 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Joint low power state assignment of sequential automata of a net implementing a parallel automaton
by: Yu. V. Pottosin
Published: (2023-03-01) -
Robust Diagnosability Analysis Using Basis Reachability Graph
by: Shiqi Li, et al.
Published: (2023-01-01) -
Remarks on the Reachability Graphs of Petri Nets
by: Yuriy Anatol’yevich Belov
Published: (2022-12-01) -
Decomposition of a parallel automaton into a net of sequential automata and low power state assignment of them at asynchronous implementation
by: Yu. V. Pottosin
Published: (2024-09-01) -
On a reachability set of automaton 3-counter machines
by: E. V. Kuzmin, et al.
Published: (2009-09-01)