An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages (Q1276242)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages |
scientific article; zbMATH DE number 1243207
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages |
scientific article; zbMATH DE number 1243207 |
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
0.92886096
0 references
0 references
0.8769033
0 references
0.86585516
0 references
0.86539793
0 references
0.86305535
0 references
0.8601721
0 references
0.85954076
0 references
0.8592984
0 references
0.8592984
0 references
