Abstract
A language L over the Cartesian product of component alphabets is called projective if it is closed under projections. That is, together with each word a 6 L, it contains all the words that have the same projections up to stuttering as a. We prove that in each of the behavior classes: ω-regular, regular and star-free irregular (i.e., definable by linear temporal logic) languages, the projective languages are precisely the Boolean combinations of stuttering-closed component languages from the corresponding class. Languages of these behavior classes can also be seen as properties of various temporal logics; some uses of projective properties for specification and verification of programs are studied.
| Original language | English |
|---|---|
| Title of host publication | Trees in Algebra and Programming - 19th International Colloquium CAAP 1994, Proceedings |
| Editors | Sophie Tison |
| Publisher | Springer Verlag |
| Pages | 291-307 |
| Number of pages | 17 |
| ISBN (Print) | 9783540578796 |
| DOIs | |
| State | Published - 1994 |
| Externally published | Yes |
| Event | 19th Colloquium on Trees in Algebra and Programming, CAAP 1994 - Edinburgh, United Kingdom Duration: 11 Apr 1994 → 13 Apr 1994 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 787 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 19th Colloquium on Trees in Algebra and Programming, CAAP 1994 |
|---|---|
| Country/Territory | United Kingdom |
| City | Edinburgh |
| Period | 11/04/94 → 13/04/94 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 1994.