@techreport{R-92-07,
TITLE = {Process Transition Networks: The Final Report},
AUTHOR = {Jacek Malec},
YEAR = {1992},
NUMBER = {R-92-07},
INSTITUTION = ida,
ADDRESS = idaaddr,
ABSTRACTURL = {/publications/cgi-bin/tr-fetch.pl?r-92-07+abstr},
ABSTRACT = {Process Transition Networks (PTNs), introduced by Sandewall [San90b], are a graphical language to describe complex qualitative processes; processes which are difficult to express quantitatively even with the help of causal dependencies. Road or air traffic monitoring, process control, or computer systems maintenance are some examples of possible application areas for PTNs. The language primitives are introduced informally, followed by a formal definition of syntax and semantics of the language. The relation between PTNs and other representation languages (Petri nets, and elementary feature logic) is considered, and it is shown that although PTNs have no more expressive power than Petri nets, their flexibility as a representation language for complex processes justifies their existence.This report contains the results published as [Mal91c], and [Mal91d].},
IDANR = {LiTH-IDA-R-92-07}