Sciweavers

402 search results - page 7 / 81
» Model Checking Quantified Computation Tree Logic
Sort
View
ICALP
2000
Springer
14 years 1 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
ARTS
1999
Springer
14 years 2 months ago
ProbVerus: Probabilistic Symbolic Model Checking
Model checking can tell us whether a system is correct; probabilistic model checking can also tell us whether a system is timely and reliable. Moreover, probabilistic model checkin...
Vicky Hartonas-Garmhausen, Sérgio Vale Agui...
ENTCS
2008
96views more  ENTCS 2008»
13 years 9 months ago
Undecidability of Model Checking in Brane Logic
The Brane Calculus is a calculus intended to model the structure and the dynamics of biological membranes. In order to express properties of systems in this calculus, in previous ...
Giorgio Bacci, Marino Miculan
CODES
2002
IEEE
14 years 2 months ago
Symbolic model checking of Dual Transition Petri Nets
This paper describes the formal verification of the recently introduced Dual Transition Petri Net (DTPN) models [12], using model checking techniques. The methodology presented a...
Mauricio Varea, Bashir M. Al-Hashimi, Luis Alejand...
IEEEHPCS
2010
13 years 8 months ago
Semantic model checking security requirements for web services
Model checking is a formal verification method widely accepted in the web service world because of its capability to reason about service behaviors, at their process-level. It ha...
L. Boaro, E. Glorio, Francesco Pagliarecci, Luca S...