201 search results - page 16 / 41 » On the Decidability of Model-Checking for P Systems |
110
click to vote
ENTCS
2007
14 years 11 months ago
2007
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
100
click to vote
FUIN
2010
14 years 9 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...
114
click to vote
DBPL
2005
Springer
15 years 5 months ago
2005
Springer
We study peer-to-peer ðP2PÞ data integration, where each peer models an autonomous system that exports data in terms of its own schema, and data interoperation is achieved by me...
107
click to vote
SEMWEB
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. This paper presents a decidable fragment for combining ontologies and rules in order-sorted logic programming. We describe ordersorted logic programming with sort, predic...
102
click to vote
IWSOS
2009
Springer
15 years 6 months ago
2009
Springer
Classical content sharing applications like BitTorrent are not designed to run over wireless networks. When adapting them to these constrained networks, two main problems arise. On...