For the most recent entries see the
Petri Nets Newsletter.
Ohta, A.
-
Ohta, A.;
Tsui, K.:
Turing machine equivalence of time asymmetric choice nets.
2000.
-
Ohta, A.;
Seto, H.;
Tsuji, K.:
On the Reachability Set of Petri Net under the Earliest Firing Rule.
2000.
-
Ohta, A.;
Hisamura, T.:
On liveness of time POC nets with the static fair condition.
1999.
-
Ohta, A.;
Tsuji, K.;
Hisamura, T.:
On liveness of extended partially ordered condition nets.
1999.
-
Ohta, A.;
Hisamura, T.:
On some analysis properties of Petri net systems under the earliest firing rule.
1996.
-
Ohta, A.;
Hisamura, T.:
A Subclass of Petri Nets Where Liveness is Preserved Under the Earliest Firing Rule.
1994.
-
Ohta, A.;
Hisamura, T.:
POC net, a subclass of Petri nets, and its application to timed Petri nets.
1993.
-
Ohta, A.;
Hisamura, T.:
On the Computational Complexity of the Reachability Problem for Marked Graphs.
1990.
-
Saito, K.;
Ohta, A.;
Hisamura, T.:
An Application of Stochastic time Petri Nets to Scheduling Problems with Uncertain Processing Times.
1989.
-
Ohta, A.;
Saitoh, K.;
Hisamura, T.:
Applications of Timed-Place Petri Nets to Scheduling Problems of Repetitive Processes.
1989.
Do you need a refined search? Try our search engine
which allows complex field-based queries.
Are you trying to get in contact with an author? Try our
database of Petri net researchers.
Back to the Petri Nets Bibliography