Stable trace automata vs. full trace automata

Authors:
Vincent Schmitt
Affiliations:
IRISA-IFSIC, Rennes, France
Venue:
Theoretical Computer Science
Year:
1998

Citing 0
Cited 2

On Recognizable Stable Trace Languages

FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Concurrent automata vs. asynchronous systems

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract