NIAOT OpenIR  > 会议论文
Modeling of control system for LAMOST Based on Petri net Workflow
Lingzhe Xu
Source PublicationModeling, Systems Engineering, and Project Management for Astronomy IV
PagesVol.7738 1I-1-7
Conference Date2010-6-27
Conference PlaceSan Diego, California, USA
Funding OrganizationThe International Society for Optical Engineering
The Chinese ever-ambitious project LAMOST (Large sky Area Multi-Object fibre Spectroscopic Telescope) has now come to its final completion of R&D stage. Major functions of the telescope have successfully passed a serial of pilot observation recently, and various kinds of applications integrated into the automation of the telescope chamber are being under vigorous site tests too. The TCS (Telescope Control System) is built on multi-layer distributed network platform with many sub-systems at different levels. How to efficiently process the enormous amount of message with particular implications running in and out the TCS is one of the major issues of the TCS software package. The paper focuses on the modelling of control system for LAMOST based on Petri net workflow. The model is also analyzed and verified with the matrix equation.
KeywordLamost Petri Net Workflow Tcs Modeling
Subject Area郭守敬望远镜(lamost) ; 自动控制
Document Type会议论文
Recommended Citation
GB/T 7714
Lingzhe Xu. Modeling of control system for LAMOST Based on Petri net Workflow[C]:SPIE,2010:Vol.7738 1I-1-7.
Files in This Item: Download All
File Name/Size DocType Version Access License
Modeling of control (296KB) 开放获取CC BY-NC-NDView Download
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Lingzhe Xu]'s Articles
Baidu academic
Similar articles in Baidu academic
[Lingzhe Xu]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Lingzhe Xu]'s Articles
Terms of Use
No data!
Social Bookmark/Share
File name: Modeling of control system for LAMOST based on Petri net workflow.pdf
Format: Adobe PDF
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.