An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages (Q1276242): Difference between revisions
From MaRDI portal
Set profile property. |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:41, 6 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages |
scientific article |
Statements
An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages (English)
0 references
30 March 1999
0 references
concurrency theory
0 references
specification languages
0 references
linear temporal logic
0 references
