%0 Journal Article
%T LABELED REACHABILITY TREE OF PETRI NETS<br>Petri网的标注可达
%A Jiang Changjun
%A Wu Zhehui
%A <br>蒋昌俊
%A 吴哲辉
%J 软件学报
%D 1993
%I 
%X The definition of labeled reachability tree of Petri nets is given in this paper. It is based on the concept of reachability tree of Petri nets. It can be proved that there exists an one correspondence between the set of Petri nets and the set of label reachability trees more over. An algorithm for transforming and in algorithm for transforming labeled reachability trees to their corresponding nets are given.
%K 标注可达树
%K 可达树
%K Petri网
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=A06A92C556DE5BF81BF742CEDD464923&yid=D418FDC97F7C2EBA&vid=E158A972A605785F&iid=B31275AF3241DB2D&sid=BC12EA701C895178&eid=D3E34374A0D77D7F&journal_id=1000-9825&journal_name=软件学报&referenced_num=3&reference_num=5