Updated URLs in case study READMEs.

git-svn-id: https://www.prismmodelchecker.org/svn/prism/prism/trunk@448 bbc10eb1-c90d-0410-af57-cb519fbb1720

prism-examples/brp/README

@@ -5,7 +5,7 @@ Its parameters are:
   N = number of chunks in a file
   MAX = maximum number of retransmissions
 
-For more information, see: http://www.cs.bham.ac.uk/~dxp/prism/casestudies/brp.html
+For more information, see: http://www.prismmodelchecker.org/casestudies/brp.html
 
 =====================================================================================
 

prism-examples/cell/README

@@ -1,6 +1,6 @@
 This case study is based on a single cell in a wireless communication network. It is taken from [HMPT00].
 
-For more information, see: http://www.cs.bham.ac.uk/~dxp/prism/casestudies/cell.html
+For more information, see: http://www.prismmodelchecker.org/casestudies/cell.html
 
 =====================================================================================
 

prism-examples/cluster/README

@@ -1,6 +1,6 @@
 This case study is based on a dependable cluster of workstations, taken from [HHK00].
 
-For more information, see: http://www.cs.bham.ac.uk/~dxp/prism/casestudies/cluster.html
+For more information, see: http://www.prismmodelchecker.org/casestudies/cluster.html
 
 =====================================================================================
 

prism-examples/dice/README

@@ -1,6 +1,6 @@
 This case study is based on probabilistic algorithms due to Knuth [KY76] which model 6-sided dice using fair coins.
 
-For more information, see: http://www.cs.bham.ac.uk/~dxp/prism/casestudies/dice.html
+For more information, see: http://www.prismmodelchecker.org/casestudies/dice.html
 
 =====================================================================================
 

prism-examples/embedded/README

@@ -1,7 +1,7 @@
 This case study models a simple embedded system, as described in [KNP04c].
 It is closely based on the example of [MCT94].
 
-For more information, see: http://www.cs.bham.ac.uk/~dxp/prism/casestudies/embedded.html
+For more information, see: http://www.prismmodelchecker.org/casestudies/embedded.html
 
 =====================================================================================
 

prism-examples/firewire/README

@@ -13,7 +13,7 @@ abst: which is represented by a single probabilistic timed automaton and is an a
 
 For both models we have used the integer semantics given in [KNS02b].
 
-For more information, see: http://www.cs.bham.ac.uk/~dxp/prism/casestudies/firewire.html
+For more information, see: http://www.prismmodelchecker.org/casestudies/firewire.html
 
 =====================================================================================
 

prism-examples/fms/README

@@ -1,6 +1,6 @@
 This case study is based on the flexible manufacturing system of [CT93].
 
-For more information, see: http://www.cs.bham.ac.uk/~dxp/prism/casestudies/fms.html
+For more information, see: http://www.prismmodelchecker.org/casestudies/fms.html
 
 =====================================================================================
 

prism-examples/kanban/README

@@ -1,6 +1,6 @@
 This case study is based on the Kanban flexible manufacturing system of [CT96].
 
-For more information, see: http://www.cs.bham.ac.uk/~dxp/prism/casestudies/kanban.html
+For more information, see: http://www.prismmodelchecker.org/casestudies/kanban.html
 
 =====================================================================================
 

prism-examples/leader/asynchronous/README

@@ -1,6 +1,6 @@
 This case study is based on the asynchronous leader election protocol of Itai & Rodeh [IR90].
 
-For more information, see: http://www.cs.bham.ac.uk/~dxp/prism/casestudies/asynchronous_leader.html
+For more information, see: http://www.prismmodelchecker.org/casestudies/asynchronous_leader.html
 
 =====================================================================================
 

prism-examples/leader/synchronous/README

@@ -1,6 +1,6 @@
 This case study is based on the synchronous leader election protocol of Itai & Rodeh [IR90].
 
-For more information, see: http://www.cs.bham.ac.uk/~dxp/prism/casestudies/synchronous_leader.html
+For more information, see: http://www.prismmodelchecker.org/casestudies/synchronous_leader.html
 
 =====================================================================================
 

prism-examples/molecules/README

@@ -6,7 +6,7 @@ This case study models several simple molecular reactions:
  
 These are taken from Ehud Shapiro's lecture notes on Biomolecular Processes as Concurrent Computation [Sha].
 
-For more information, see: http://www.cs.bham.ac.uk/~dxp/prism/casestudies/molecules.html
+For more information, see: http://www.prismmodelchecker.org/casestudies/molecules.html
 
 =====================================================================================
 

prism-examples/mutual/README

@@ -21,7 +21,7 @@ No:	No:	Description:			State:
 14	18	leaving	critical section	admit
 15	19	leaving	critical section	admit
 
-For more information, see: http://www.cs.bham.ac.uk/~dxp/prism/casestudies/mutual.html
+For more information, see: http://www.prismmodelchecker.org/casestudies/mutual.html
 
 =====================================================================================
 

prism-examples/phil/nofair/README

@@ -1,7 +1,7 @@
 This case study is based on Lehmann and Rabin's solution to the well known dining philosophers problem [LR81].
 It considers the version presented in [DFP04] which removes the need to consider 'fairness' assumptions on the scheduling mechanism.
 
-For more information, see: http://www.cs.bham.ac.uk/~dxp/prism/casestudies/phil.html
+For more information, see: http://www.prismmodelchecker.org/casestudies/phil.html
 
 =====================================================================================
 

prism-examples/phil/original/README

@@ -1,6 +1,6 @@
 This case study is based on Lehmann and Rabin's solution to the well known dining philosophers problem [LR81].
 
-For more information, see: http://www.cs.bham.ac.uk/~dxp/prism/casestudies/phil.html
+For more information, see: http://www.prismmodelchecker.org/casestudies/phil.html
 
 =====================================================================================
 

prism-examples/phil_lss/README

@@ -1,7 +1,7 @@
 This case study is based on Lehmann and Rabin's solution to the well known dining philosophers problem [LR81]
 and the analysis of this algorithm by Lynch, Saias and Segala [LSS94].
 
-For more information, see: http://www.cs.bham.ac.uk/~dxp/prism/casestudies/phil_lss.html
+For more information, see: http://www.prismmodelchecker.org/casestudies/phil_lss.html
 
 =====================================================================================
 

prism-examples/polling/README

@@ -1,6 +1,6 @@
 This case study is based on a cyclic server polling system, taken from [IT90].
 
-For more information, see: http://www.cs.bham.ac.uk/~dxp/prism/casestudies/polling.html
+For more information, see: http://www.prismmodelchecker.org/casestudies/polling.html
 
 =====================================================================================
 

prism-examples/rabin/README

@@ -1,6 +1,6 @@
 This case study is based on Rabin's solution to the well known mutual exclusion problem [Rab82].
 
-For more information, see: http://www.cs.bham.ac.uk/~dxp/prism/casestudies/rabin.html
+For more information, see: http://www.prismmodelchecker.org/casestudies/rabin.html
 
 =====================================================================================
 

prism-examples/self-stabilisation/beauquier/README

@@ -1,6 +1,6 @@
 This case study is based on Beauquier, Gradinariu and Johnen's self-stabilising algorithm [BGJ99].
 
-For more information, see: http://www.cs.bham.ac.uk/~dxp/prism/casestudies/self-stabilisation.html
+For more information, see: http://www.prismmodelchecker.org/casestudies/self-stabilisation.html
 
 =====================================================================================
 

prism-examples/self-stabilisation/herman/README

@@ -1,6 +1,6 @@
 This case study is based on Herman's self-stabilising algorithm [Her90].
 
-For more information, see: http://www.cs.bham.ac.uk/~dxp/prism/casestudies/self-stabilisation.html
+For more information, see: http://www.prismmodelchecker.org/casestudies/self-stabilisation.html
 
 =====================================================================================
 

prism-examples/self-stabilisation/israeli-jalfon/README

@@ -1,6 +1,6 @@
 This case study is based on Israeli and Jalfon's self-stabilising algorithm [IJ90].
 
-For more information, see: http://www.cs.bham.ac.uk/~dxp/prism/casestudies/self-stabilisation.html
+For more information, see: http://www.prismmodelchecker.org/casestudies/self-stabilisation.html
 
 =====================================================================================
 

prism-examples/tandem/README

@@ -1,6 +1,6 @@
 This case study is based on a simple tandem queueing network, taken from [HMKS99].
 
-For more information, see: http://www.cs.bham.ac.uk/~dxp/prism/casestudies/tandem.html
+For more information, see: http://www.prismmodelchecker.org/casestudies/tandem.html
 
 =====================================================================================