201 search results - page 22 / 41 » On the Decidability of Model-Checking for P Systems |
104
click to vote
LATA
2009
Springer
15 years 6 months ago
2009
Springer
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
HICSS
2008
IEEE
15 years 6 months ago
2008
IEEE
Many peer-to-peer (P2P) networks have been widely used for file sharing. A peer acts both as a content provider and a consumer, and is granted autonomy to decide what content, wit...
78
Voted
TACAS
2005
Springer
15 years 5 months ago
2005
Springer
Searching the state space of a system using enumerative and on-the-fly depth-first traversal is an established technique for model checking finite-state systems. In this paper, ...
OTM
2010
Springer
14 years 10 months ago
2010
Springer
Recently, mashups have emerged as an important class of Web 2.0 collaborative applications. Mashups can be conceived as personalized Web services which aggregate and manipulate dat...
111
click to vote
ENTCS
2007
14 years 11 months ago
2007
This paper gives an overview of recent advances in Real-Time Maude. Real-Time Maude extends the Maude rewriting logic tool to support formal specification and analysis of object-...