Abstract. In this paper, we propose a new framework for the parametric verification of time Petri nets with stopwatches controlled by inhibitor arcs. We first introduce an extensio...
Louis-Marie Traonouez, Didier Lime, Olivier H. Rou...
Dominance testing, the problem of determining whether an outcome is preferred over another, is of fundamental importance in many applications. Hence, there is a need for algorithm...
Model checking is a powerful and widespread technique for the verification of finite distributed systems. However, the main hindrance for wider application of this technique is the...
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
We present a model of access control which provides fine-grained data-dependent control, can express permissions about permissions, can express delegation, and can describe syste...
Dimitar P. Guelev, Mark Ryan, Pierre-Yves Schobben...