1650 search results - page 2 / 330 » The HOM problem is decidable |
FUIN
2010
13 years 2 months ago
2010
In this paper we study decidability of several extensions of P/T nets with name creation and/or replication. In particular, we study how to restrict the models of RN systems (P/T n...
CONCUR
2012
Springer
11 years 7 months ago
2012
Springer
We introduce a nominal actor-based language and study its expressive power. We have identified the presence/absence of fields as a relevant feature: the dynamic creation of names...
POPL
2012
ACM
12 years 8 days ago
2012
ACM
Since software systems are becoming increasingly more concurrent and distributed, modeling and analysis of interactions among their components is a crucial problem. In several app...
DLT
2009
13 years 2 months ago
2009
Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k 2, is NP-hard [Theoret...
VSTTE
2012
Springer
12 years 7 days ago
2012
Springer
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...