The following pages link to Tadao Murata (Q1052099):
Displaying 15 items.
- A method for stepwise refinement and abstraction of Petri nets (Q1052100) (← links)
- Fair relation and modified synchronic distances in a Petri net (Q1067788) (← links)
- Relevance of network theory to models of distributed/parallel processing (Q1138905) (← links)
- A predicate-transition net model for parallel interpretation of logic programs (Q3801054) (← links)
- Proof procedure and answer extraction in Petri net model of logic programs (Q3817016) (← links)
- Synthesis of Decision-Free Concurrent Systems for Prescribed Resources and Performance (Q3893321) (← links)
- Additional methods for reduction and expansion of marked graphs (Q3920656) (← links)
- State equation, controllability, and maximal matchings of petri nets (Q4126143) (← links)
- (Q4136584) (← links)
- (Q4138656) (← links)
- Circuit theoretic analysis and synthesis of marked graphs (Q4186238) (← links)
- (Q4250957) (← links)
- Hierarchical reachability graph of bounded Petri nets for concurrent-software analysis (Q4302739) (← links)
- Temporal uncertainty and fuzzy-timing high-level Petri nets (Q4633152) (← links)
- Petri Nets and Marked Graphs--Mathematical Models of Concurrent Computation (Q4745266) (← links)
