Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic (Q6151620): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jlamp.2023.100938 / rank | |||
| Property / cites work | |||
| Property / cites work: Invariant Analysis for Multi-agent Graph Transformation Systems Using k-Induction / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Probabilistic Metric Temporal Graph Logic / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JLAMP.2023.100938 / rank | |||
Normal rank | |||
Latest revision as of 18:56, 30 December 2024
scientific article; zbMATH DE number 7803183
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic |
scientific article; zbMATH DE number 7803183 |
Statements
Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic (English)
0 references
12 February 2024
0 references
cyber-physical systems
0 references
probabilistic timed systems
0 references
qualitative analysis
0 references
quantitative analysis
0 references
bounded model checking
0 references
0 references
0 references
