Model keyword tidy-up: nondeterministic -> mdp.

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

prism-examples/firewire/abst/deadline.nm

@@ -1,7 +1,7 @@
 // integer semantics version of abstract firewire protocol
 // gxn 23/05/2001
 
-nondeterministic
+mdp
 
 //deadline
 const int deadline;

prism-examples/firewire/abst/firewire.nm

@@ -1,7 +1,7 @@
 // integer semantics version of abstract firewire protocol
 // gxn 23/05/2001
 
-nondeterministic
+mdp
 
 // largest constant the clock of the system is compared to
 const int kx = 167;

prism-examples/leader/asynchronous/leader10.nm

@@ -2,7 +2,7 @@
 // 10 processes
 // gxn/dxp 29/01/01
 
-nondeterministic
+mdp
 
 const N=10; // number of processes
 

prism-examples/leader/asynchronous/leader3.nm

@@ -2,7 +2,7 @@
 // 3 processes
 // gxn/dxp 29/01/01
 
-nondeterministic
+mdp
 
 const N=3; // number of processes
 

prism-examples/leader/asynchronous/leader4.nm

@@ -2,7 +2,7 @@
 // 4 processes
 // gxn/dxp 29/01/01
 
-nondeterministic
+mdp
 
 const N=4; // number of processes
 

prism-examples/leader/asynchronous/leader5.nm

@@ -2,7 +2,7 @@
 // 5 processes
 // gxn/dxp 29/01/01
 
-nondeterministic
+mdp
 
 const N=5; // number of processes
 

prism-examples/leader/asynchronous/leader6.nm

@@ -2,7 +2,7 @@
 // 6 processes
 // gxn/dxp 29/01/01
 
-nondeterministic
+mdp
 
 const N=6; // number of processes
 

prism-examples/leader/asynchronous/leader7.nm

@@ -2,7 +2,7 @@
 // 7 processes
 // gxn/dxp 29/01/01
 
-nondeterministic
+mdp
 
 const N=7; // number of processes
 

prism-examples/leader/asynchronous/leader8.nm

@@ -2,7 +2,7 @@
 // 8 processes
 // gxn/dxp 29/01/01
 
-nondeterministic
+mdp
 
 const N=8; // number of processes
 

prism-examples/leader/asynchronous/leader9.nm

@@ -2,7 +2,7 @@
 // 9 processes
 // gxn/dxp 29/01/01
 
-nondeterministic
+mdp
 
 const N=9; // number of processes
 

prism-examples/mutual/mutual10.nm

@@ -1,7 +1,7 @@
 // mutual exclusion [PZ82]
 // dxp/gxn 19/12/99
 
-nondeterministic
+mdp
 
 // atomic formula
 // none in low, high, tie

prism-examples/mutual/mutual3.nm

@@ -1,7 +1,7 @@
 // mutual exclusion [PZ82]
 // dxp/gxn 19/12/99
 
-nondeterministic
+mdp
 
 // atomic formula
 // none in low, high, tie

prism-examples/mutual/mutual4.nm

@@ -1,7 +1,7 @@
 // mutual exclusion [PZ82]
 // dxp/gxn 19/12/99
 
-nondeterministic
+mdp
 
 // atomic formula
 // none in low, high, tie

prism-examples/mutual/mutual5.nm

@@ -1,7 +1,7 @@
 // mutual exclusion [PZ82]
 // dxp/gxn 19/12/99
 
-nondeterministic
+mdp
 
 // atomic formula
 // none in low, high, tie

prism-examples/mutual/mutual8.nm

@@ -1,7 +1,7 @@
 // mutual exclusion [PZ82]
 // dxp/gxn 19/12/99
 
-nondeterministic
+mdp
 
 // atomic formula
 // none in low, high, tie

prism-examples/phil/nofair/phil-nofair10.nm

@@ -1,12 +1,12 @@
 // randomized dining philosophers [LR81]
-// dxp/gxn 23/01/02
-
+// dxp/gxn 23/01/02
+
 // model which does not require fairness
 // remove the possibility of loops:
 // (1) cannot stay in thinking 
 // (2) if first fork not free then cannot move (another philosopher must more)
 
-nondeterministic
+mdp
 
 // atomic formulae 
 // left fork free and right fork free resp.

prism-examples/phil/nofair/phil-nofair3.nm

@@ -1,12 +1,12 @@
 // randomized dining philosophers [LR81]
-// dxp/gxn 23/01/02
-
+// dxp/gxn 23/01/02
+
 // model which does not require fairness
 // remove the possibility of loops:
 // (1) cannot stay in thinking 
 // (2) if first fork not free then cannot move (another philosopher must more)
 
-nondeterministic
+mdp
 
 // atomic formulae 
 // left fork free and right fork free resp.

prism-examples/phil/nofair/phil-nofair4.nm

@@ -1,12 +1,12 @@
 // randomized dining philosophers [LR81]
-// dxp/gxn 23/01/02
-
+// dxp/gxn 23/01/02
+
 // model which does not require fairness
 // remove the possibility of loops:
 // (1) cannot stay in thinking 
 // (2) if first fork not free then cannot move (another philosopher must more)
 
-nondeterministic
+mdp
 
 // atomic formulae 
 // left fork free and right fork free resp.

prism-examples/phil/nofair/phil-nofair5.nm

@@ -1,12 +1,12 @@
 // randomized dining philosophers [LR81]
-// dxp/gxn 23/01/02
-
+// dxp/gxn 23/01/02
+
 // model which does not require fairness
 // remove the possibility of loops:
 // (1) cannot stay in thinking 
 // (2) if first fork not free then cannot move (another philosopher must more)
 
-nondeterministic
+mdp
 
 // atomic formulae 
 // left fork free and right fork free resp.

prism-examples/phil/nofair/phil-nofair6.nm

@@ -1,12 +1,12 @@
 // randomized dining philosophers [LR81]
-// dxp/gxn 23/01/02
-
+// dxp/gxn 23/01/02
+
 // model which does not require fairness
 // remove the possibility of loops:
 // (1) cannot stay in thinking 
 // (2) if first fork not free then cannot move (another philosopher must more)
 
-nondeterministic
+mdp
 
 // atomic formulae 
 // left fork free and right fork free resp.

prism-examples/phil/nofair/phil-nofair7.nm

@@ -1,12 +1,12 @@
 // randomized dining philosophers [LR81]
-// dxp/gxn 23/01/02
-
+// dxp/gxn 23/01/02
+
 // model which does not require fairness
 // remove the possibility of loops:
 // (1) cannot stay in thinking 
 // (2) if first fork not free then cannot move (another philosopher must more)
 
-nondeterministic
+mdp
 
 // atomic formulae 
 // left fork free and right fork free resp.

prism-examples/phil/nofair/phil-nofair8.nm

@@ -1,12 +1,12 @@
 // randomized dining philosophers [LR81]
-// dxp/gxn 23/01/02
-
+// dxp/gxn 23/01/02
+
 // model which does not require fairness
 // remove the possibility of loops:
 // (1) cannot stay in thinking 
 // (2) if first fork not free then cannot move (another philosopher must more)
 
-nondeterministic
+mdp
 
 // atomic formulae 
 // left fork free and right fork free resp.

prism-examples/phil/nofair/phil-nofair9.nm

@@ -1,12 +1,12 @@
 // randomized dining philosophers [LR81]
-// dxp/gxn 23/01/02
-
+// dxp/gxn 23/01/02
+
 // model which does not require fairness
 // remove the possibility of loops:
 // (1) cannot stay in thinking 
 // (2) if first fork not free then cannot move (another philosopher must more)
- 
-nondeterministic
+
+mdp
 
 // atomic formulae 
 // left fork free and right fork free resp.

prism-examples/phil/original/phil10.nm

@@ -1,8 +1,5 @@
 // randomized dining philosophers [LR81]
 // dxp/gxn 12/12/99
-
-nondeterministic
-
 // atomic formulae 
 // left fork free and right fork free resp.
 formula lfree = p2=0..4,6,10;

prism-examples/phil/original/phil15.nm

@@ -1,8 +1,5 @@
 // randomized dining philosophers [LR81]
 // dxp/gxn 12/12/99
-
-nondeterministic
-
 // atomic formulae 
 // left fork free and right fork free resp.
 formula lfree = p2=0..4,6,10;

prism-examples/phil/original/phil20.nm

@@ -1,8 +1,5 @@
 // randomized dining philosophers [LR81]
 // dxp/gxn 12/12/99
-
-nondeterministic
-
 // atomic formulae 
 // left fork free and right fork free resp.
 formula lfree = p2=0..4,6,10;

prism-examples/phil/original/phil25.nm

@@ -1,8 +1,5 @@
 // randomized dining philosophers [LR81]
 // dxp/gxn 12/12/99
-
-nondeterministic
-
 // atomic formulae 
 // left fork free and right fork free resp.
 formula lfree = p2=0..4,6,10;

prism-examples/phil/original/phil3.nm

@@ -1,8 +1,5 @@
 // randomized dining philosophers [LR81]
 // dxp/gxn 12/12/99
-
-nondeterministic
-
 // atomic formulae 
 // left fork free and right fork free resp.
 formula lfree = p2=0..4,6,10;

prism-examples/phil/original/phil30.nm

@@ -1,8 +1,5 @@
 // randomized dining philosophers [LR81]
 // dxp/gxn 12/12/99
-
-nondeterministic
-
 // atomic formulae 
 // left fork free and right fork free resp.
 formula lfree = p2=0..4,6,10;

prism-examples/phil/original/phil4.nm

@@ -1,8 +1,5 @@
 // randomized dining philosophers [LR81]
 // dxp/gxn 12/12/99
-
-nondeterministic
-
 // atomic formulae 
 // left fork free and right fork free resp.
 formula lfree = p2=0..4,6,10;

prism-examples/phil/original/phil5.nm

@@ -1,8 +1,5 @@
 // randomized dining philosophers [LR81]
 // dxp/gxn 12/12/99
-
-nondeterministic
-
 // atomic formulae 
 // left fork free and right fork free resp.
 formula lfree = p2=0..4,6,10;

prism-examples/phil/original/phil6.nm

@@ -1,8 +1,5 @@
 // randomized dining philosophers [LR81]
 // dxp/gxn 12/12/99
-
-nondeterministic
-
 // atomic formulae 
 // left fork free and right fork free resp.
 formula lfree = p2=0..4,6,10;

prism-examples/phil/original/phil7.nm

@@ -1,8 +1,5 @@
 // randomized dining philosophers [LR81]
 // dxp/gxn 12/12/99
-
-nondeterministic
-
 // atomic formulae 
 // left fork free and right fork free resp.
 formula lfree = p2=0..4,6,10;

prism-examples/phil/original/phil8.nm

@@ -1,8 +1,5 @@
 // randomized dining philosophers [LR81]
 // dxp/gxn 12/12/99
-
-nondeterministic
-
 // atomic formulae 
 // left fork free and right fork free resp.
 formula lfree = p2=0..4,6,10;

prism-examples/phil/original/phil9.nm

@@ -1,7 +1,7 @@
 // randomized dining philosophers [LR81]
 // dxp/gxn 12/12/99
 
-nondeterministic
+mdp
 
 // atomic formulae 
 // left fork free and right fork free resp.

prism-examples/phil_lss/phil_lss3.nm

@@ -3,7 +3,7 @@
 // an a process can wait at most K time units before making a transition
 // gxn/dxp 01/02/00
 
-nondeterministic
+mdp
 
 // CONSTANTS
 const K;
@@ -96,4 +96,4 @@ rewards "steps"
 	[s1] true : 1;
 	[s2] true : 1;
 	[s3] true : 1;
-endrewards
+endrewards

prism-examples/phil_lss/phil_lss4.nm

@@ -3,7 +3,7 @@
 // an a process can wait at most K time units before making a transition
 // gxn/dxp 01/02/00
 
-nondeterministic
+mdp
 
 // CONSTANTS
 const K;
@@ -125,4 +125,4 @@ rewards "steps"
 	[s2] true : 1;
 	[s3] true : 1;
 	[s4] true : 1;
-endrewards
+endrewards