Replication, refinement \& reachability: complexity in dynamic condition-response graphs (Q1671247): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Model checking LTL using constraint programming / rank | |||
Normal rank | |||
Revision as of 10:56, 4 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Replication, refinement \& reachability: complexity in dynamic condition-response graphs |
scientific article |
Statements
Replication, refinement \& reachability: complexity in dynamic condition-response graphs (English)
0 references
6 September 2018
0 references
0 references
0 references
0 references
0 references
