The reachability problem of Petri net with priority is undecidable!
- From: calender2002@xxxxxxx
- Date: 5 Aug 2006 23:53:08 -0700
I have known that the reachability problem of Petri net with
priority is undecidable. But I don't know in which paper this was
proved, if you know please inform me. Thanks!
helios
.
- Prev by Date: Adding practical (runtime) facts to a program
- Next by Date: Re: Subsets from a set
- Previous by thread: Adding practical (runtime) facts to a program
- Next by thread: Re: List of hard Problems with Transitions from underconstrained to overconstrained
- Index(es):
