In: The Computer Journal, vol.45, no.1, pages 111-128. 2002.
Abstract: This paper continues research on the stubborn set method that constructs on-the-fly a reduced LTS that is CFFD-equivalent to the parallel composition of given LTSs. In particular, minimization of the number of successor states of a given state is reconsidered. The earlier suggested and/or-graph approach requires solving
Keywords: LTSs; stubborn sets; and/or-graphs; approximability in optimization and counting.
Back to the Petri Nets Bibliography