Equivalence between model-checking flat counter systems and Presburger arithmetic (Q2636509): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the complexity of the linear-time μ-calculus for Petri Nets / rank | |||
Normal rank | |||
Latest revision as of 10:53, 4 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equivalence between model-checking flat counter systems and Presburger arithmetic |
scientific article |
Statements
Equivalence between model-checking flat counter systems and Presburger arithmetic (English)
0 references
5 June 2018
0 references
model-checking
0 references
flat counter systems
0 references
temporal logic
0 references
CTL*
0 references
Presburger arithmetic
0 references
0 references
