T
Tadao Murata
Researcher at University of Illinois at Chicago
Publications - 68
Citations - 12952
Tadao Murata is an academic researcher from University of Illinois at Chicago. The author has contributed to research in topics: Petri net & Stochastic Petri net. The author has an hindex of 25, co-authored 68 publications receiving 12516 citations. Previous affiliations of Tadao Murata include University of Illinois at Urbana–Champaign & University of California, Berkeley.
Papers
More filters
Journal ArticleDOI
Petri nets: Properties, analysis and applications
TL;DR: The author proceeds with introductory modeling examples, behavioral and structural properties, three methods of analysis, subclasses of Petri nets and their analysis, and one section is devoted to marked graphs, the concurrent system model most amenable to analysis.
Journal ArticleDOI
A method for stepwise refinement and abstraction of Petri nets
Ichiro Suzuki,Tadao Murata +1 more
TL;DR: Conditions under which a subnet can be substituted for a single transition while preserving properties such as liveness and boundedness are presented.
Journal ArticleDOI
Detection of Ada static deadlocks using Petri net invariants
TL;DR: Algorithmic translation of the Ada programs into Petri nets which preserve control-flow and message-flow properties is described, and algorithms are given to analyze the nets to obtain information about static deadlocks that can occur in the original programs.
Journal ArticleDOI
Generating basis siphons and traps of Petri nets using the sign incidence matrix
Erwin R. Boer,Tadao Murata +1 more
TL;DR: In this paper, the sign incidence matrix for Petri nets is introduced and a simple algorithm for generating all basis siphons or traps without first generating all siphons and traps is presented.
Journal ArticleDOI
A predicate-transition net model for parallel interpretation of logic programs
Tadao Murata,Du Zhang +1 more
TL;DR: The proposed net model offers a syntactical variant of Horn clause logic and has two distinctions from other existing schemes for the logic programs: representation formalism and the deduction method.