Sciweavers

7 search results - page 2 / 2
» LP Deadlock Checking Using Partial Order Dependencies
Sort
View
SBMF
2009
Springer
126views Formal Methods» more  SBMF 2009»
13 years 10 months ago
Undecidability Results for Distributed Probabilistic Systems
Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such ev...
Sergio Giro
CSL
2007
Springer
13 years 11 months ago
Incorporating Tables into Proofs
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...
Dale Miller, Vivek Nigam