Sciweavers

5863 search results - page 89 / 1173
» On Model-Checking of P Systems
Sort
View
106
Voted
IPTPS
2004
Springer
15 years 6 months ago
2 P2P or Not 2 P2P?
In the hope of stimulating discussion, we present a heuristic decision tree that designers can use to judge how suitable a P2P solution might be for a particular problem. It is bas...
Mema Roussopoulos, Mary Baker, David S. H. Rosenth...
CHARME
2001
Springer
107views Hardware» more  CHARME 2001»
15 years 4 months ago
Using Combinatorial Optimization Methods for Quantification Scheduling
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
Pankaj Chauhan, Edmund M. Clarke, Somesh Jha, Jame...
ICALP
2000
Springer
15 years 4 months ago
Decidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
Denis Lugiez, Ph. Schnoebelen
CAI
2006
Springer
15 years 25 days ago
Formal Verification of Security Model Using SPR Tool
In this paper, formal verification methodologies and the SPR (Safety Problem Resolver) model checking tool are used for verifying a security model's safety. The SPR tool makes...
Il-Gon Kim, Miyoung Kang, Jin-Young Choi, Peter D....
RTCSA
1999
IEEE
15 years 5 months ago
Scheduling a Steel Plant with Timed Automata
Scheduling in an environment with constraints of many different types is known to be a hard problem. We tackle this problem for an integrated steel plant in Ghent, Belgium, using ...
Ansgar Fehnker