321 search results - page 61 / 65 » Symbolic Model Checking for Probabilistic Timed Automata |
FORTE
1996
13 years 8 months ago
1996
The paper describes the application of SDL-92[1] and OMT[2] to the design of a V5.x Access Network interface. While OMT is used to model the management aspects of the system, typi...
PPDP
2010
Springer
13 years 5 months ago
2010
Springer
We propose a model for XML update primitives of the W3C XQuery Update Facility as parameterized rewriting rules of the form: "insert an unranked tree from a regular tree lang...
FOSSACS
2003
Springer
14 years 20 days ago
2003
Springer
rized Verification by Probabilistic Abstraction . . . . . . . . . . . . . . . . 87 Tamarah Arons, Amir Pnueli, Lenore Zuck Genericity and the π-Calculus . . . . . . . . . . . . ....
BCS
2008
13 years 9 months ago
2008
Using formal verification for designing hardware designs free from logic design bugs has been an active area of research since the last 15 years. Technology has matured and we hav...
KI
2009
Springer
14 years 2 months ago
2009
Springer
Today’s complex production systems allow to simultaneously build different products following individual production plans. Such plans may fail due to component faults or unfores...