The language of certain conflicts of a nondeterministic process

Malik, Robi

The language of certain conflicts of a nondeterministic process

dc.contributor.author	Malik, Robi
dc.date.accessioned	2010-07-07T21:01:29Z
dc.date.available	2010-07-07T21:01:29Z
dc.date.issued	2010-07-07
dc.description.abstract	The language of certain conflicts is the most general set of behaviours of a nondeterministic process, which certainly lead to a livelock or deadlock when accepted by another process running in parallel. It is of great use in model checking to detect livelocks or deadlocks in very large systems, and in process-algebra to obtain abstractions preserving livelock and deadlock. Unfortunately, the language of certain conflicts is difficult to compute and has only been approximated in previous work. This paper presents an effective algorithm to calculate the language of certain conflicts for any given nondeterministic finite-state process and discusses its properties. The algorithm is shown to be correct and of exponential complexity.	en_NZ
dc.format.mimetype	application/pdf
dc.identifier.citation	Malik, R. (2010). The language of certain conflicts of a nondeterministic process. (Working paper 05/2010). Hamilton, New Zealand: University of Waikato, Department of Computer Science.	en_NZ
dc.identifier.issn	1177-777X
dc.identifier.uri	https://hdl.handle.net/10289/4108
dc.language.iso	en
dc.publisher	University of Waikato, Department of Computer Science	en_NZ
dc.relation.ispartofseries	Computer Science Working Papers
dc.subject	computer science	en_NZ
dc.subject	computer language	en_NZ
dc.title	The language of certain conflicts of a nondeterministic process	en_NZ
dc.type	Journal Article	en_NZ
pubs.elements-id	54057
pubs.place-of-publication	Hamilton, New Zealand	en_NZ
uow.relation.series	05/2010