Sciweavers

TACAS
2000
Springer
138views Algorithms» more  TACAS 2000»
14 years 3 months ago
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
This paper reports on experimental results with symbolic model checking of probabilistic processes based on Multi-Terminal Binary Decision Diagrams (MTBDDs). We consider concurrent...
Luca de Alfaro, Marta Z. Kwiatkowska, Gethin Norma...
ACSD
2006
IEEE
80views Hardware» more  ACSD 2006»
14 years 5 months ago
Schedulability Analysis of Petri Nets Based on Structural Properties
A schedule of a Petri Net (PN) represents a set of firing sequences that can be infinitely repeated within a bounded state space, regardless of the outcomes of the nondeterminis...
Cong Liu, Alex Kondratyev, Yosinori Watanabe, Albe...