Efficient state-exploration

dc.contributor.author	Geldenhuys, J
dc.contributor.editor	Ram, Vevek
dc.date.accessioned	2018-08-15T09:41:35Z
dc.date.available	2018-08-15T09:41:35Z
dc.date.issued	1996
dc.identifier.citation	Geldenhuys, J. (1996) Efficient state-exploration. Industry Meets Academia: Proceedings of the 1996 National Research and Development Conference, The South African Institute of Computer Scientists and Information Technologists, Interaction Conference Centre, University of Natal, Durban, 26 & 27 September, hosted by The Department of Computer Science and Information Systems, University of Natal, Pietermaritzburg, edited by Vevek Ram, (ISBN 0-620-20568-7).	en
dc.identifier.isbn	0-620-20568-7
dc.identifier.uri	http://hdl.handle.net/10500/24630
dc.description.abstract	The exploration of states is an important element of many problems. Many problems share properties which allow the formulation of general strategies for state exploration. This article examines these strategies with reference to the problem of deadlock detection in labelled transition systems. The main issues are discussed and four major tasks are identified: state generation, scheduling, state storage, and state compaction. Empirical data is presented, optimizations and special restrictions are discussed and, finally, the results are generalized.	en
dc.language.iso	en	en
dc.title	Efficient state-exploration	en