Formal technique
A formal technique is a mathematical method to specify a hardware and/or software system, verify whether a specification is realizable, verify that an implementation satisfies its specification, examine properties of a organisation without necessarily running the system, etc. The mathematical dry reason of a formal method is provided yesteryear the specification language.
Formal specification language
A formal specification linguistic communication consists of ii sets syn too sem, too a relation sat betwixt them. The gear upward syn is called the syntactic domain, the gear upward sem is called the semantic domain, too the relation sat is called the satisfaction relation. For a given specification syn, too model of the organisation sem, if sat (syn, sem), equally shown inwards fig too hence syn is said to last the specification of sem, too sem is said to last the specificand of syn.
fig: sat (syn, sem)
Syntactic Domains
The syntactic domain of a formal specification linguistic communication consists of an alphabet of symbols too gear upward of formation rules to build well-formed formulas from the alphabet. The well-formed formulas are used to specify a system.
Semantic Domains
Formal techniques tin accept considerably unlike semantic domains. Abstract information type specification languages are used to specify algebras, theories, too programs. Programming languages are used to specify functions from input to output values. Concurrent too distributed organisation specification languages are used to specify state sequences, final result sequences, state-transition sequences, synchronization trees, partial orders, state machines, etc.
Satisfaction Relation
Given the model of a system, it is of import to receive upward one's heed whether an chemical constituent of the semantic domain satisfies the specifications. This satisfaction is determined yesteryear using a homomorphism known equally semantic abstraction function. The semantic abstraction business office maps the elements of the semantic domain into equivalent classes. There tin last unlike specifications describing unlike aspects of a organisation model, perchance using unlike specification languages.
Some of these specifications depict the system’s direct too the others depict the system’s structure. Consequently, ii wide classes of semantic abstraction functions are defined: those that save a system’s direct too those that save a system’s structure.
Sumber http://how2mechanicalengineering.blogspot.com/
A formal technique is a mathematical method to specify a hardware and/or software system, verify whether a specification is realizable, verify that an implementation satisfies its specification, examine properties of a organisation without necessarily running the system, etc. The mathematical dry reason of a formal method is provided yesteryear the specification language.
Formal specification language
A formal specification linguistic communication consists of ii sets syn too sem, too a relation sat betwixt them. The gear upward syn is called the syntactic domain, the gear upward sem is called the semantic domain, too the relation sat is called the satisfaction relation. For a given specification syn, too model of the organisation sem, if sat (syn, sem), equally shown inwards fig too hence syn is said to last the specification of sem, too sem is said to last the specificand of syn.
fig: sat (syn, sem)
Syntactic Domains
The syntactic domain of a formal specification linguistic communication consists of an alphabet of symbols too gear upward of formation rules to build well-formed formulas from the alphabet. The well-formed formulas are used to specify a system.
Semantic Domains
Formal techniques tin accept considerably unlike semantic domains. Abstract information type specification languages are used to specify algebras, theories, too programs. Programming languages are used to specify functions from input to output values. Concurrent too distributed organisation specification languages are used to specify state sequences, final result sequences, state-transition sequences, synchronization trees, partial orders, state machines, etc.
Satisfaction Relation
Given the model of a system, it is of import to receive upward one's heed whether an chemical constituent of the semantic domain satisfies the specifications. This satisfaction is determined yesteryear using a homomorphism known equally semantic abstraction function. The semantic abstraction business office maps the elements of the semantic domain into equivalent classes. There tin last unlike specifications describing unlike aspects of a organisation model, perchance using unlike specification languages.
Some of these specifications depict the system’s direct too the others depict the system’s structure. Consequently, ii wide classes of semantic abstraction functions are defined: those that save a system’s direct too those that save a system’s structure.