{"id":{"repo_id":"eastern-wash","oai_identifier":"oai:dc.ewu.edu:theses-1874"},"canonical_url":"https://search.dev.ndltd.org/etd/eastern-wash/oai:dc.ewu.edu:theses-1874","repository":{"repo_id":"eastern-wash","name":"Eastern Washington University","base_url":"https://dc.ewu.edu/do/oai/"},"display":{"title":"Visual parallel programming via petri nets","abstract":"<p>The objective of this paper is to determine the feasibility and produceability of a Petri net based CASE tool, thus the majority of this paper is the implementation and explanation thereof. The requirements of this implementation are as follows: a. Graphical input and manipulation of a Petri net. b. The generation of a formal definition from a given graph. c. The generation of code from a given formal definition. d. A CASE library to support parallel structures. During the implementation of this thesis it became apparent that a static dictionary for the CASE library would not be sufficient and a means to allow for customizing was required. Providing this programmability was not the topic of this thesis, but has become a substantial facet and possibly is a topic in and of itself. I leave it to the reader/user to explore the extents of that realm. The Apple Macintosh, due to its graphic ability and availability was selected as the platform for this implementation. This version of the program requires a color Macintosh and does not support many of the Macintoshs standard features. The implementation presented in this document meets the above requirements, and has produced executable code. At present the program consists of two separate applications that take the user from Petri net to executing code. The first handles all graphical input and editing of the Petri net and culminates in the generation of the formal definition. The second program generates the code from the formal definition and the library language. The separation is required for the later to be easily transferrable to any computing platform while the graphical interface is machine specific. Due to the requirements of the supporting NASA project, the code generated is Occam, and the target processor is the Inmos Transputer.</p>","abstract_html":"&lt;p&gt;The objective of this paper is to determine the feasibility and produceability of a Petri net based CASE tool, thus the majority of this paper is the implementation and explanation thereof. The requirements of this implementation are as follows: a. Graphical input and manipulation of a Petri net. b. The generation of a formal definition from a given graph. c. The generation of code from a given formal definition. d. A CASE library to support parallel structures. During the implementation of this thesis it became apparent that a static dictionary for the CASE library would not be sufficient and a means to allow for customizing was required. Providing this programmability was not the topic of this thesis, but has become a substantial facet and possibly is a topic in and of itself. I leave it to the reader/user to explore the extents of that realm. The Apple Macintosh, due to its graphic ability and availability was selected as the platform for this implementation. This version of the program requires a color Macintosh and does not support many of the Macintoshs standard features. The implementation presented in this document meets the above requirements, and has produced executable code. At present the program consists of two separate applications that take the user from Petri net to executing code. The first handles all graphical input and editing of the Petri net and culminates in the generation of the formal definition. The second program generates the code from the formal definition and the library language. The separation is required for the later to be easily transferrable to any computing platform while the graphical interface is machine specific. Due to the requirements of the supporting NASA project, the code generated is Occam, and the target processor is the Inmos Transputer.&lt;/p&gt;","abstract_has_math":false,"creators":["Passey, David Glenn"],"institution":null,"degree_name":"Master of Science (MS) in Computer Science","degree_level":"Thesis: EWU Only","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1990,"date_issued":"1990-01-01T08:00:00Z","date_published":"1990-01-01T08:00:00Z","updated_at":"2026-07-24T02:12:46Z","subjects":["Other Computer Sciences","Programming Languages and Compilers"],"languages":[],"rights":["Access perpetually restricted to EWU users with an active EWU NetID"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://dc.ewu.edu/theses/872","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Passey, David Glenn"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis: EWU Only"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS) in Computer Science"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Other Computer Sciences","Programming Languages and Compilers"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["Access perpetually restricted to EWU users with an active EWU NetID"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://dc.ewu.edu/theses/872"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<p>The objective of this paper is to determine the feasibility and produceability of a Petri net based CASE tool, thus the majority of this paper is the implementation and explanation thereof. The requirements of this implementation are as follows: a. Graphical input and manipulation of a Petri net. b. The generation of a formal definition from a given graph. c. The generation of code from a given formal definition. d. A CASE library to support parallel structures. During the implementation of this thesis it became apparent that a static dictionary for the CASE library would not be sufficient and a means to allow for customizing was required. Providing this programmability was not the topic of this thesis, but has become a substantial facet and possibly is a topic in and of itself. I leave it to the reader/user to explore the extents of that realm. The Apple Macintosh, due to its graphic ability and availability was selected as the platform for this implementation. This version of the program requires a color Macintosh and does not support many of the Macintoshs standard features. The implementation presented in this document meets the above requirements, and has produced executable code. At present the program consists of two separate applications that take the user from Petri net to executing code. The first handles all graphical input and editing of the Petri net and culminates in the generation of the formal definition. The second program generates the code from the formal definition and the library language. The separation is required for the later to be easily transferrable to any computing platform while the graphical interface is machine specific. Due to the requirements of the supporting NASA project, the code generated is Occam, and the target processor is the Inmos Transputer.</p>"]},{"key":"dc:title","label":"Title","values":["Visual parallel programming via petri nets"]}]}],"canonical_facts":{"dc:creator":["Passey, David Glenn"],"dc:description.abstract":["<p>The objective of this paper is to determine the feasibility and produceability of a Petri net based CASE tool, thus the majority of this paper is the implementation and explanation thereof. The requirements of this implementation are as follows: a. Graphical input and manipulation of a Petri net. b. The generation of a formal definition from a given graph. c. The generation of code from a given formal definition. d. A CASE library to support parallel structures. During the implementation of this thesis it became apparent that a static dictionary for the CASE library would not be sufficient and a means to allow for customizing was required. Providing this programmability was not the topic of this thesis, but has become a substantial facet and possibly is a topic in and of itself. I leave it to the reader/user to explore the extents of that realm. The Apple Macintosh, due to its graphic ability and availability was selected as the platform for this implementation. This version of the program requires a color Macintosh and does not support many of the Macintoshs standard features. The implementation presented in this document meets the above requirements, and has produced executable code. At present the program consists of two separate applications that take the user from Petri net to executing code. The first handles all graphical input and editing of the Petri net and culminates in the generation of the formal definition. The second program generates the code from the formal definition and the library language. The separation is required for the later to be easily transferrable to any computing platform while the graphical interface is machine specific. Due to the requirements of the supporting NASA project, the code generated is Occam, and the target processor is the Inmos Transputer.</p>"],"dc:identifier":["https://dc.ewu.edu/theses/872"],"dc:rights":["Access perpetually restricted to EWU users with an active EWU NetID"],"dc:subject":["Other Computer Sciences","Programming Languages and Compilers"],"dc:title":["Visual parallel programming via petri nets"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis: EWU Only"],"thesis:degree_name":["Master of Science (MS) in Computer Science"]},"updated_at":"2026-07-24T02:12:46Z"}