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
-
Remarks on the Reachability Graphs of Petri Nets
by: Yuriy Anatol’yevich Belov
Published: (2022-12-01) -
On a reachability set of automaton 3-counter machines
by: E. V. Kuzmin, et al.
Published: (2009-09-01) -
Recursive-Parallel Algorithm for Solving the Graph-Subgraph Isomorphism Problem
by: Vladimir V. Vasilchikov
Published: (2022-03-01) -
Threaded block-parallel algorithm for finding the shortest paths on graph
by: O. N. Karasik, et al.
Published: (2019-06-01) -
CPN Tools-Assisted Simulation and Verification of Nested Petri Nets
by: L. W. Dworza´nski, et al.
Published: (2015-03-01)