31 search results - page 2 / 7 » Analysis of invariants for efficient bounded verification |
CCS
2008
ACM
13 years 9 months ago
2008
ACM
We present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a numbe...
FORTE
2008
13 years 8 months ago
2008
Model programs represent transition systems that are used fy expected behavior of systems at a high level of abstraction. The main application area is application-level network pro...
ICFEM
2009
Springer
13 years 4 months ago
2009
Springer
Bounded timed-arc Petri nets with read-arcs were recently proven equivalent to networks of timed automata, though the Petri net model cannot express urgent behaviour and the descri...
UAI
2004
13 years 8 months ago
2004
The sensitivities revealed by a sensitivity analysis of a probabilistic network typically depend on the entered evidence. For a real-life network therefore, the analysis is perfor...
FORMATS
2009
Springer
13 years 11 months ago
2009
Springer
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic ti...