Sciweavers

5863 search results - page 86 / 1173
» On Model-Checking of P Systems
Sort
View
107
Voted
CONEXT
2007
ACM
15 years 4 months ago
Building a reliable P2P system out of unreliable P2P clients: the case of KAD
Damiano Carra, Ernst W. Biersack
85
Voted
PPNA
2010
109views more  PPNA 2010»
14 years 11 months ago
From P2P to reliable semantic P2P systems
Abdul-Rahman Mawlood-Yunis, Michael Weiss, Nicola ...
101
Voted
LPAR
2005
Springer
15 years 6 months ago
Pushdown Module Checking
Model checking is a useful method to verify automatically the correctness of a system with respect to a desired behavior, by checking whether a mathematical model of the system sat...
Laura Bozzelli, Aniello Murano, Adriano Peron
104
Voted
CONCUR
2004
Springer
15 years 4 months ago
A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications
We introduce a generic family of behavioral relations for which the problem of comparing an arbitrary transition system to some finite-state specification can be reduced to a model...
Antonín Kucera, Ph. Schnoebelen
86
Voted
TACAS
2005
Springer
115views Algorithms» more  TACAS 2005»
15 years 6 months ago
On-the-Fly Reachability and Cycle Detection for Recursive State Machines
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, ...
Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, P....