Filling factor - Revision history

en>Monkbot: /* Definition */Task 2: Fix CS1 deprecated coauthor parameter errors (bot trial)

2014-04-12T15:08:05Z

Definition: Task 2: Fix CS1 deprecated coauthor parameter errors (bot trial)

← Older revision		Revision as of 17:08, 12 April 2014
Line 1:		Line 1:
	~~{{Context\|date=October 2009}}~~		Wilber Berryhill is the title his mothers and fathers gave him and he totally digs that name. Alaska is where he's always been residing. What me and my family members adore is performing ballet but I've been taking on new things recently. Invoicing is my profession.<br><br>Also visit my web-site - [http://kjhkkb.net/xe/notice/374835 certified psychics]
	~~'''Abstraction Model checking''' is for systems where an actual representation~~ is ~~too complex in developing~~ the ~~model alone~~. ~~So, the design undergoes a kind of translation to scaled down "abstract" version~~.

	~~The set of [[Variable (mathematics)\|variables]] are partitioned into visible~~ and ~~invisible depending~~ on ~~their change of values~~. ~~The real [[state space]]~~ is ~~summarized into a smaller set of the visible ones.~~

	~~==Galois connected==~~
	~~The real and the abstract state spaces are [[Galois connection\|Galois connected]]~~. This means that if we take an element from the [[abstract space]], concretize it and abstract the concretized version, the result will be equal to the original. On the other hand, if you pick an element from the real space, abstract it and concretize the abstract version, the final result will be a super set of the original.

	~~That is,~~

	<~~math~~>~~\eta~~<~~/math~~>~~(<math>\theta<~~/~~math>(abstract)) = abstract <br~~/>
	~~<math>\theta<~~/~~math>(<math>\eta</math>(real)) <math>\supset<~~/~~math> real~~

	~~==Abstraction refinement loop==~~
	A problem with abstraction [[model checking]] is that although the abstraction simulates the real, when the abstraction does not satisfy a property, it does not mean that this property actually fails in the real model. Counter examples are checked against the real state space because we obtain "spurious" counter examples. So a part of the abstraction refinement loop is:
	~~#Obtain the abstract model~~
	~~#Model check and see if everything is ok.~~
	~~#If there is a counter example, then go back to the real state space and find out if it actually a counter model.~~
	~~#If not, return and continue model checking.~~

	Spurious examples are mostly generated because dead end states and bad states are abstracted to the same kind. To solve this we need to create a segregation between the 2 kinds. The next step is to find the subset of invisible variables that actually make a difference between the dead end and bad states and add this subset to the set of visible or monitored variables. If the separation proves expensive, refinement could be based on learning from samples.

	~~==References==~~
	* {{cite journal \| author=Edmund M. Clarke and Orna Grumberg and David E. Long \| title=Model checking and abstraction \| journal=ACM Transactions on Programming Languages and Systems\| year=1992\| volume=16 \| issue=5 \| pages=1512–1542 \| doi=10.1145/~~186025.186051}}~~

	~~[[Category:Model checking]~~]

en>Yobot: WP:CHECKWIKI error fixes using AWB (9773)

2013-12-04T21:41:46Z

WP:CHECKWIKI error fixes using AWB (9773)

← Older revision		Revision as of 23:41, 4 December 2013
Line 1:		Line 1:
	The ~~name~~ of ~~the author is Jayson~~. ~~Distributing production~~ is ~~how he tends to make~~ a ~~residing~~. ~~Ohio is where his home is~~ and ~~his family enjoys~~ it. ~~To play lacross is one~~ of the ~~things she enjoys most~~.<br><br>~~my blog post online psychics~~ ([~~https~~:~~//www~~.~~machlitim~~.~~org~~.~~il/subdomain/megila/~~end~~/node/12300 www~~.~~machlitim~~.~~org~~.il])		{{Context\|date=October 2009}}
			'''Abstraction Model checking''' is for systems where an actual representation is too complex in developing the model alone. So, the design undergoes a kind of translation to scaled down "abstract" version.

			The set of [[Variable (mathematics)\|variables]] are partitioned into visible and invisible depending on their change of values. The real [[state space]] is summarized into a smaller set of the visible ones.

			==Galois connected==
			The real and the abstract state spaces are [[Galois connection\|Galois connected]]. This means that if we take an element from the [[abstract space]], concretize it and abstract the concretized version, the result will be equal to the original. On the other hand, if you pick an element from the real space, abstract it and concretize the abstract version, the final result will be a super set of the original.

			That is,

			<math>\eta</math>(<math>\theta</math>(abstract)) = abstract <br/>
			<math>\theta</math>(<math>\eta</math>(real)) <math>\supset</math> real

			==Abstraction refinement loop==
			A problem with abstraction [[model checking]] is that although the abstraction simulates the real, when the abstraction does not satisfy a property, it does not mean that this property actually fails in the real model. Counter examples are checked against the real state space because we obtain "spurious" counter examples. So a part of the abstraction refinement loop is:
			#Obtain the abstract model
			#Model check and see if everything is ok.
			#If there is a counter example, then go back to the real state space and find out if it actually a counter model.
			#If not, return and continue model checking.

			Spurious examples are mostly generated because dead end states and bad states are abstracted to the same kind. To solve this we need to create a segregation between the 2 kinds. The next step is to find the subset of invisible variables that actually make a difference between the dead end and bad states and add this subset to the set of visible or monitored variables. If the separation proves expensive, refinement could be based on learning from samples.

			==References==
			* {{cite journal \| author=Edmund M. Clarke and Orna Grumberg and David E. Long \| title=Model checking and abstraction \| journal=ACM Transactions on Programming Languages and Systems\| year=1992\| volume=16 \| issue=5 \| pages=1512–1542 \| doi=10.1145/186025.186051}}

			[[Category:Model checking]]

en>Bibcode Bot: Adding 0 arxiv eprint(s), 2 bibcode(s) and 0 doi(s). Did it miss something? Report bugs, errors, and suggestions at User talk:Bibcode Bot

2012-08-06T04:35:44Z

Adding 0 arxiv eprint(s), 2 bibcode(s) and 0 doi(s). Did it miss something? Report bugs, errors, and suggestions at User talk:Bibcode Bot

New page

The name of the author is Jayson. Distributing production is how he tends to make a residing. Ohio is where his home is and his family enjoys it. To play lacross is one of the things she enjoys most.<br><br>my blog post online psychics ([https://www.machlitim.org.il/subdomain/megila/end/node/12300 www.machlitim.org.il])