摘要
本文从数据库系统在时刻 t的状态 N出发 ,构造出相应的 Petri网模型 ,进而构造出其可达标识图 .通过分析可达标识图 ,可判断系统是否为死锁状态 .若不是死锁状态 ,系统是否可能出现死锁 ,什么情况下系统肯定不会出现死锁 .最后 。
The corresponding Petri net model is structured starting from N state of databse system at t moment, and then a reachable marked graph is structured in this paper. The deadlock state of database system, whether its should be produced or not , is judged by analyzing reachable marked graphs. If it is not in a dealock state, whether the deadlock of system should be produced or not, under what circumstances the deadlock of system is not produced in the affirmative. Lastly, the measures of deadlock detection and avoidance are given for the concurrent operation on transaction in database system.
出处
《小型微型计算机系统》
CSCD
北大核心
2003年第7期1297-1300,共4页
Journal of Chinese Computer Systems
基金
山东省自然科学基金资助课题 (项目号 G0 810 8)
