31 search results - page 2 / 7 » Analysis of invariants for efficient bounded verification |
CCS
2008
ACM
15 years 1 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
15 years 1 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...
109
click to vote
ICFEM
2009
Springer
14 years 9 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
15 years 1 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...
105
click to vote
FORMATS
2009
Springer
15 years 3 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...