Presentation 1994/1/26
An algorithm to decide concurrent firability for a marked qraph
Masaki Takahashi, Toshiro Araki, Toshinobu Kashiwabara,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Concurrent firability problem for a Petri net is defined as follows:given a transition set A,decide whether or not there exists a reachable marking from initial marking at which all transitions in A are enabled. It is known that there exists an Ο( F )time algorithm for concur rent firabihtv problem when the given Petri net is in a subclass of Petri net called marked graph and number of all arcs in the marked graph. In this paper,we extend the above result and present an Ο( A )time decision algorithm for marked graphs.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Petri net / marked graph / concument firability
Paper # COMP93-76
Date of Issue

Conference Information
Committee COMP
Conference Date 1994/1/26(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) An algorithm to decide concurrent firability for a marked qraph
Sub Title (in English)
Keyword(1) Petri net
Keyword(2) marked graph
Keyword(3) concument firability
1st Author's Name Masaki Takahashi
1st Author's Affiliation Department of information and computer scicnce,faculty of engineering science,Osaka University()
2nd Author's Name Toshiro Araki
2nd Author's Affiliation Department of information and computer scicnce,faculty of engineering science,Osaka University
3rd Author's Name Toshinobu Kashiwabara
3rd Author's Affiliation Department of information and computer scicnce,faculty of engineering science,Osaka University
Date 1994/1/26
Paper # COMP93-76
Volume (vol) vol.93
Number (no) 438
Page pp.pp.-
#Pages 8
Date of Issue