PROCESSING GRAPH METHOD 2.0 SEMANTICS
by
David J. Kaplan & Richard S. Stevens
September 15, 1995

1. Introduction

2. What problem was PGM built to solve?

3. A View of PGM

3.1 Familys
3.2 Graphs and Command Programs
3.3 Instantiation Procedures

4. Anatomy of the graph

4.1 Graphs and graph parts

4.2 Place

4.2.1 Queue
4.2.2 Graph variable
4.2.3 Graph constant

4.3 Transition

4.3.1 The unconstrained transition
4.3.2 Transition statement
4.3.3 The constrained transitions
4.3.3.1 The ordinary transitions
4.3.3.1.1 General case
4.3.3.1.2 Two high utility ordinary transitions
4.3.3.1.2.1 Fanin
4.3.3.1.2.2 Fanout
4.3.3.2 Special transitions
4.3.3.2.1 Pack
4.3.3.2.2 Unpack
4.3.3.2.3 Uncontrolledmerge

4.4 Graph determinacy, a warning

5. Command programs

5.1 Instantiation procedures (IPs) and graph construction procedures (GCPs)

5.1.1 IPs
5.1.2 GCPs
5.1.2.1 Create and empty graph
5.1.2.2 Include a place
5.1.2.3 Include a transition
5.1.2.4 Include a copy of a graph
5.1.2.5 Include a graph
5.1.2.6 Link
5.1.2.7 Include a graph port
5.1.2.8 Name graph
5.1.2.9 Save the state of a graph
5.1.2.10 Reset a graph to a previously saved state
5.1.2.11 Create a copy of an existing graph
5.1.2.12 Delete a graph

5.1.3 Graph manipulation and interaction
5.1.3.1 Start execution of a graph
5.1.3.2 Suspend execution of a graph
5.1.3.3 Write one or more tokens to a graph input place port
5.1.2.4 Read one or more tokens from a graph output place port
5.1.2.5 Call a procedure which executes as a graph

Appendix A

Appendix B

Please send comments about this web page to webmaster@ait.nrl.navy.mil.
Last updated 01/29/1999.