11 search results - page 1 / 3 » Decidability and Undecidability of Marked PCP |
STACS
1999
Springer
14 years 3 months ago
1999
Springer
We show that the marked version of the Post Correspondence Problem, where the words on a list are required to di er in the rst letter, is decidable. On the other hand, PCP remains ...
TCS
2002
13 years 10 months ago
2002
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
ACTAC
2002
13 years 11 months ago
2002
: In this paper we study the home marking problem for Petri nets, and some related concepts to it like confluence, noetherianity, and state space inclusion. We show that the home m...
APN
2009
Springer
14 years 5 months ago
2009
Springer
In previous works we defined ν-APNs, an extension of P/T nets with the capability of creating and managing pure names. We proved that, though reachability is undecidable, coverab...
CONCUR
2009
Springer
14 years 3 months ago
2009
Springer
We consider the model of Time Petri Nets where time is associated with transitions. Two semantics for time elapsing can be considered: the strong one, for which all transitions are...