On projective and separable properties

Doron Peled

doi:10.1007/bfb0017489

On projective and separable properties

Doron Peled

Lucent

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

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	https://doi.org/10.1007/bfb0017489
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.

Access to Document

10.1007/bfb0017489

Cite this

Peled, D. (1994). On projective and separable properties. In S. Tison (Ed.), Trees in Algebra and Programming - 19th International Colloquium CAAP 1994, Proceedings (pp. 291-307). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 787 LNCS). Springer Verlag. https://doi.org/10.1007/bfb0017489

@inproceedings{e028288a4036449aa4dbf4ca55075b93,

title = "On projective and separable properties",

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.",

author = "Doron Peled",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1994.; 19th Colloquium on Trees in Algebra and Programming, CAAP 1994 ; Conference date: 11-04-1994 Through 13-04-1994",

year = "1994",

doi = "10.1007/bfb0017489",

language = "אנגלית",

isbn = "9783540578796",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "291--307",

editor = "Sophie Tison",

booktitle = "Trees in Algebra and Programming - 19th International Colloquium CAAP 1994, Proceedings",

address = "גרמניה",

}

Peled, D 1994, On projective and separable properties. in S Tison (ed.), Trees in Algebra and Programming - 19th International Colloquium CAAP 1994, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 787 LNCS, Springer Verlag, pp. 291-307, 19th Colloquium on Trees in Algebra and Programming, CAAP 1994, Edinburgh, United Kingdom, 11/04/94. https://doi.org/10.1007/bfb0017489

On projective and separable properties. / Peled, Doron.
Trees in Algebra and Programming - 19th International Colloquium CAAP 1994, Proceedings. ed. / Sophie Tison. Springer Verlag, 1994. p. 291-307 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 787 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On projective and separable properties

AU - Peled, Doron

PY - 1994

Y1 - 1994

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85010991965

U2 - 10.1007/bfb0017489

DO - 10.1007/bfb0017489

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85010991965

SN - 9783540578796

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 291

EP - 307

BT - Trees in Algebra and Programming - 19th International Colloquium CAAP 1994, Proceedings

A2 - Tison, Sophie

PB - Springer Verlag

T2 - 19th Colloquium on Trees in Algebra and Programming, CAAP 1994

Y2 - 11 April 1994 through 13 April 1994

ER -

On projective and separable properties

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this