An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages (Q1276242): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q200942 |
Changed an Item |
||
| Property / author | |||
| Property / author: Doron A. Peled / rank | |||
Normal rank | |||
Revision as of 18:42, 10 February 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
