130 search results - page 1 / 26 » Decidability Problems of a Basic Class of Object Nets |
FUIN
2007
13 years 4 months ago
2007
It is shown that the boundedness problem for a certain class of basic object nets and a corresponding class of multiset rewriting systems is decidable. To achieve this result Dicks...
AC
2003
Springer
13 years 9 months ago
2003
Springer
We address the problem of deciding uniformly for graphs or languages of a given class whether they are generated by unlabelled Place-Transition nets whose sets of reachable marking...
IFM
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. In this paper, we address the problem of expressing objectoriented concepts in terms of Petri nets. This is interesting, first, as a possibility of representing concurre...
FSTTCS
2006
Springer
13 years 8 months ago
2006
Springer
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...
ATAL
2008
Springer
13 years 6 months ago
2008
Springer
Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficien...