Comeau, Marc Andrew (1986) Reachability and sequencing in marked graphs and state graphs : algorithms based on network programming. PhD thesis, Concordia University.
Preview |
Text (application/pdf)
8MBNL32244.pdf |
| Divisions: | Concordia University > Gina Cody School of Engineering and Computer Science > Electrical and Computer Engineering |
|---|---|
| Item Type: | Thesis (PhD) |
| Authors: | Comeau, Marc Andrew |
| Pagination: | xii, 214 leaves : ill. ; 29 cm. |
| Institution: | Concordia University |
| Degree Name: | Ph. D. |
| Program: | Electrical Engineering |
| Date: | 1986 |
| Thesis Supervisor(s): | Thulasiraman, Krishnaiyan |
| Identification Number: | QA 267 C575X 1986 |
| ID Code: | 4066 |
| Deposited By: | lib-batchimporter |
| Deposited On: | 27 Aug 2009 19:35 |
| Last Modified: | 10 Nov 2022 21:15 |
| Related URLs: |
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.
Repository Staff Only: item control page
Download Statistics
Download Statistics