Selected publications by Antoine Petit

V. Diekert, P. Gastin and A. Petit. Recognizable Complex Trace Languages. In Proceedings of the 16th International Symposium on Mathematical Foundations of Computer Science (MFCS'91), Kazimierz Dolny, Poland, September 1991, LNCS 520, pages 131-140. Springer-Verlag. ( PS | PS.GZ )

Abstract:: A. Mazurkiewicz defined traces in order to modelize non-sequential processes. Complex traces have been recently introduced as a generalization of both traces and infinite words. This paper studies the family of recognizable complex trace languages. It is proved that this family is closed under boolean operations, concatenation, left and right quotients. Then sufficient conditions ensuring the recognizability of the finite and infinite iterations of a recognizable complex trace language are given. The notion of co-iteration is defined and the Kleene-Ochmański theorem is generalized to complex traces.

`@inproceedings{VD-PG-AP-mfcs91,`
	`address =`	`{Kazimierz Dolny, Poland},`
	`author =`	`{Diekert, Volker and Gastin, Paul and Petit, Antoine},`
	`booktitle =`	`{{P}roceedings of the 16th {I}nternational {S}ymposium on {M}athematical {F}oundations of {C}omputer {S}cience ({MFCS}'91)},`
	`editor =`	`{Tarlecki, Andrzej},`
	`month =`	`sep,`
	`pages =`	`{131-140},`
	`publisher =`	`{Springer-Verlag},`
	`series =`	`{Lecture Notes in Computer Science},`
	`title =`	`{Recognizable Complex Trace Languages},`
	`url =`	`{http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/IC95dgp.ps},`
	`volume =`	`{520},`
	`year =`	`{1991},`
`}`

About LSV