CN109857458A - The method for transformation of the flattening of AltaRica 3.0 based on ANTLR - Google Patents
The method for transformation of the flattening of AltaRica 3.0 based on ANTLR Download PDFInfo
- Publication number
- CN109857458A CN109857458A CN201910158660.5A CN201910158660A CN109857458A CN 109857458 A CN109857458 A CN 109857458A CN 201910158660 A CN201910158660 A CN 201910158660A CN 109857458 A CN109857458 A CN 109857458A
- Authority
- CN
- China
- Prior art keywords
- flattening
- class
- altarica
- file
- antlr
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Landscapes
- Devices For Executing Special Programs (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The method for transformation of the flattening of AltaRica 3.0 based on ANTLR mainly includes two partial contents: first, writing the ANTLR grammar file of AltaRica 3.0, obtaining corresponding abstract syntax tree；Second, the algorithm using design operates syntax tree, the file of flattening is obtained by 3.0 hierarchical file of AltaRica of some system inputted.The present invention is to solve the important solutions that 3.0 model hierarchy thaumatropy of AltaRica is compressed structure, by the structure for being converted into flattening, can AltaRica model to some system carry out safety analysis, in Safety-Critical System field, this process is very important.
Description
Technical field
The invention belongs to Safety-Critical System fields, and in particular to a kind of flattening of the AltaRica3.0 based on ANTLR
Method for transformation.
Background technique
ANTLR-Another Tool for Language Recognition, predecessor is PCCTS, it is to include
Language including Java, C++, C# provides one and constructs automatically by syntactic description the identifier of customized language
(recognizer), the frame of compiler (parser) and interpreter (translator).ANTLR can be by asserting
(Predicate) conflict of qualification is solved；Support acts (Action) and return value (Return Value)；It can be according to input
It automatically generates syntax tree and visually shows.The translation of computer language becomes a common task-and exists as a result,
YACC/LEX seems excessively academism before this, although and the also slightly deficiency in efficiency of the ANTLR based on LL (k),
It is by upgrading modification in recent years, so that ANTLR is enough to deal with existing most applications.ANTLR is based on EBNF
Syntax analyzer tool, be the important foundation stone of many language of composition, tool and frame, can be used for reading, handle, executing and turning over
The text or binary file for translating structuring, are widely used in sphere of learning and actual industrial production.Twitter
Using the powerful syntactic analysis function of ANTLR, the inquiry more than 2,000,000,000 times can handle daily, in the ecosystem of Hadoop
Language has all used ANTLR.The syntax rule of any language can be transformed into the lattice of ANTLR syntax parsing file by user
Formula (metalanguage of ANTLR) obtains the ANTLR grammar file for wanting analytic language, by running the built-in method of ANTLR, energy
Generate corresponding lexical analyzer and syntax analyzer.At this time if inputting specific language file, so that it may use morphology point
The character stream of input file is transformed into the label stream being made of phrase by parser according to corresponding morphological rule, can be obtained specific
The morphological analysis of language is visualized as one as a result, syntax analyzer can be utilized to mark streams be combined these in next step
Abstract syntax tree (AST (Abstract Syntax Tree)), all morphological informations are stored in the leaf node of AST,
User can formulate corresponding transformation rule, get implementing result according to oneself actual requirement.
AltaRica is a kind of advanced modeling language for being dedicated to safety analysis.The first edition of the language is in the latter stage nineties
It is created in university computer research laboratory, Bordeaux (LaBRI).This first version to establish basic conception,
But for commercial scale model, this expends very much resource.Therefore, second is created in Luminy Institute of Mathematics after several years
A version AltaRica Data-Flow.AltaRica Data-Flow is several industrial integrated mouldings and simulated environment now
Core: Cecilia OCAS (Dassault Aviation), Simfia (EADS Apsys) and safe design teacher (Dassault
Systemes).In addition, having developed a large amount of tools to assess AltaRica data flow model, such as fault tree compiler, Ma Er
It can husband's chain compiler, critical event sequence generator, stochastic simulator and model checker.AltaRica data flow integrated moulding
With simulated environment it is widely used in various industries, document report many successful industrial applications, AltaRica data flow are present
Industrial maturity is had reached.The behavior of AltaRica component is described by state machine, and the state of component is (so-called by variable
State variable) and its value indicate.Only when an event occurs, the variation of state is possible to occur, they are retouched by being converted
It states.Information of the flow variable for recycling between simulated assembly, they are updated by asserting, are asserted and are held after each conversion
Row.Component can be combined into hierarchical structure, and outputting and inputting for they can connect and their conversion can synchronize.
GTS is a kind of state/reformulations for being dedicated to safety analysis, it summarises reliability block diagram, Markov chain
And stochastic Petri net.Three operations are defined on bodyguard's conversion system, they can be assembled into level knot by these operations
Structure.Therefore, protected conversion system is a kind of complete description language (on the contrary, in form, such as finite state machine or routine
Petri network).Flow variable value after stablizing each conversion ring by introducing stabiliser, GTS can indicate have
The system (such as network system or electrical system) of instant loop, and non-causal component can be designed, i.e., the direction of component is flowed
Amount is propagated and is determined at runtime.Therefore, GTS has also promoted the background mathematics model of schema automaton AltaRica data flow.
AltaRica 3.0 can only be considered as describing and constructing a kind of easy way of bodyguard's conversion system.Bodyguard's conversion system (GTS)
It is a kind of automatic machine, state is indicated by variable label, i.e. variable and its value.The translation table that the variation of state is triggered by event
Show, also may indicate that the flowing for flowing through network and synchronous event to describe the remote interaction between the system component studied.
GTS summarises reliability block diagram, Markov chain and Petri network.
The basic goal of flattening is to carry out safety analysis to Safety-Critical System, and the hierarchical structure of AltaRica 3.0 is
For describing the Schema information of system, directly progress safety analysis is impossible, and the system of flattening then can use reliably
Property block diagram, Markov chain and Petri network carry out the safety analysis of model.The flattening operation of AltaRica is pure grammer
Operation is based on this, and the method for transformation of the flattening of the AltaRica 3.0 proposed by the present invention based on ANTLR passes through ANTLR pairs
AltaRica 3.0 carries out syntactic analysis, and the operation of corresponding flattening is then carried out by AST.
Summary of the invention
The present invention aiming at the shortcomings in the prior art, provides the flattening of AltaRica 3.0 based on ANTLR a kind of
Method for transformation.Mainly include two partial contents: first, writing the ANTLR grammar file of AltaRica 3.0, obtaining corresponding
Abstract syntax tree.Second, the algorithm using design operates syntax tree, by the AltaRica 3.0 of some system inputted
The file of hierarchical file acquisition flattening.
To achieve the above object, the invention adopts the following technical scheme:
The method for transformation of the flattening of AltaRica 3.0 based on ANTLR, which comprises the steps of:
Step 1: writing the ANTLR grammar file of AltaRica 3.0, corresponding abstract syntax tree is obtained；
Step 2: writing algorithm, AST is traversed, obtains the nodal value of AST, is carried out according to flattening algorithm flat
Operation.
To optimize above-mentioned technical proposal, the concrete measure taken further include:
Further, in the step 1, by the grammer supporting paper of AltaRica 3.0, first language of ANTLR is utilized
The ANTLR syntax parsing file of speech building AltaRica 3.0 gets AltaRica by running the built-in method of ANTLR
3.0 morphology and grammar parser obtains corresponding AST by inputting 3.0 example of AltaRica.
Further, in the step 2, the flattening layered of AltaRica 3.0 operation is pure syntax behaviour
Make, the entrance by main module Block as entire flattening process, multiple Block and multiple Class files, according to ANTLR points
Its abstract syntax tree is not established.
Further, in the step 2, flattening algorithm first draws 3.0 model file of AltaRica
Point, its main module Block and submodule Block, and its all Class of reference are found out, multiple " .alt " files are got,
In conjunction with the ANTLR syntax parsing file of AltaRica 3.0, input file of " .alt " file as flattening algorithm is right first
The AST of main module Block is analyzed, determine its reference all Class and it includes submodule Block, obtain layer
Belonging relation between secondary file, then in the operation to Class as submodule Block progress.
Further, in the step 2, flattening algorithm is to carry out continuous iterative process in following steps:
1) program entry of the main module Block as entire flattening process is got, to the syntax tree of main module Block
Layering traversal is carried out, the Class and submodule Block file of its nested first layer are obtained, the Class information of reference is stored
Into corresponding map mapping, as the reference hierarchy information of next step Class syntax tree, while a random length is defined
Character string s, the module name of upper one layer of Block is added in character string s, at this point, before character string s is exactly current Block
Sew identifier, and the information of Block flattening is deposited into the flattening file B of storage BlockflatIn, level is carried out again
Traversal and extreme saturation, repeat above-mentioned operation, until getting most deep node；
2) the Class information of the main module reference got according to step 1), traverses map, stores according in map
Class class name and Instance Name, the AST file that Automatic-searching is established to corresponding Class file, Instance Name is exactly current at this time
The prefix identifier of Class, determines the belonging relation of Class, while obtaining the other Class of current Class file reference
The other Class class name and Instance Name of reference is stored in corresponding map, is repeating the above process, until true by the file information
The prefix identifier of fixed all Class.
Further, in the step 2, the hierarchical file of flattening is operated, the conversion letter of this document
Breath includes that three kinds of events: normal event, synchronous event and hiding event, wherein synchronous event and hiding event include normal thing
Part；In the AST that flattening file is formed, the type of corresponding event is directly acquired by the attribute of node, obtains synchronous thing
The value that node stores in part and hiding event, i.e., normal transformation event traverse AST further according to obtained value, obtain corresponding thing
The expression formula and instruction that part includes, then according to synchronous flattening rule and hiding flattening rule to the expression formula in event
It is operated with instruction, synchronous event and hiding event after obtaining flattening.
The beneficial effects of the present invention are: the present invention is to solve 3.0 model hierarchy thaumatropy of AltaRica as flattening
The important solutions of structure, by being converted into the structure of flattening, can the AltaRica model to some system pacify
Full property analysis, in Safety-Critical System field, this process is very important.
Detailed description of the invention
Fig. 1 is the resolving of ANTLR.
Fig. 2 is the AltaRica3.0 flattening algorithm frame based on ANTLR.
Fig. 3 is Block flattening pseudo-code of the algorithm.
Fig. 4 is Class flattening algorithm.
Fig. 5 is synchronous flattening process.
Specific embodiment
In conjunction with the accompanying drawings, the present invention is further explained in detail.
The problem of present invention mainly solves the flattenings of AltaRica 3.0, Fig. 1 are the resolving of ANTLR, and Fig. 2 is base
In the 3.0 flattening algorithm frame of AltaRica of ANTLR, the AltaRica's 3.0 proposed by the present invention based on ANTLR is flat
The method for transformation of change mainly includes following two partial content.
One, the ANTLR grammar file for writing AltaRica 3.0, obtains corresponding abstract syntax tree.
By the grammer supporting paper of AltaRica 3.0, construct AltaRica's 3.0 using the metalanguage of ANTLR
ANTLR syntax parsing file gets the morphology and syntax parsing of AltaRica 3.0 by running the built-in method of ANTLR
Device passes through some 3.0 example of AltaRica of input, available corresponding AST.
Two, algorithm is write, AST is traversed, obtains the nodal value of AST, flat operation is carried out according to flattening algorithm.
The flattening layered of AltaRica 3.0 operation is pure Syntactic Manipulation, by main module Block as whole
The entrance of a flattening process, multiple Block and multiple Class files, its abstract syntax tree is established according to ANTLR respectively.It is flat
Graduation algorithm is named as A2GTS algorithm herein, to divide to 3.0 model file of AltaRica, find out its main mould
Block Block and submodule Block, and its all Class of reference, get multiple " .alt " files, in conjunction with AltaRica
3.0 ANTLR syntax parsing file, input file of " .alt " file as A2GTS algorithm, first to main module Block's
AST is analyzed, determine its reference all Class and it includes submodule Block, obtain the institute between hierarchical file
Category relationship, then in the operation to Class as submodule Block progress, the general thought of A2GTS algorithm is exactly following
Step 1) and step 2) carry out continuous iterative process.
1) program entry of the main module Block as entire flattening process is got, to the syntax tree of main module Block
Layering traversal is carried out, the Class and submodule Block file of its nested first layer are obtained, the Class information of reference is stored
Into corresponding map mapping, as the reference hierarchy information of next step Class syntax tree, while a random length is defined
Character string s, the module name of upper one layer of Block is added in character string s, at this point, before character string s is exactly current Block
Sew identifier, and the information of Block flattening is deposited into the flattening file B of storage BlockflatIn, level is carried out again
Traversal and extreme saturation, repeat above-mentioned operation, until getting most deep node.Specific algorithm pseudocode such as Fig. 3 institute
Show.
2) the Class information of the main module reference got according to step 1), traverses map, stores according in map
Class class name and Instance Name, the AST file that Automatic-searching is established to corresponding Class file, Instance Name is exactly current at this time
The prefix identifier of Class, determines the belonging relation of Class, while obtaining the other Class of current Class file reference
Class class name and Instance Name are stored in corresponding map, repeat the above process by the file information, all until determining
The prefix identifier of Class.Specific algorithm pseudocode is as shown in Figure 4.
3) hierarchical file of flattening is operated, the conversion information of this document includes this three kinds of events:
Normal event, synchronous event and hiding event, the relationship of three are exactly inclusion relation, and wherein synchronous event and hiding event include
Normal event.In the AST that flattening file is formed, the main distinction of the storage mode of three kinds of events is exactly its storage section
The difference of the attribute information of point, therefore the type of corresponding event can be directly obtained by the attribute of node, it is synchronized
The value (normal transformation event) that node stores in event and hiding event traverses AST, is corresponded to further according to obtained value
The expression formula and instruction that event includes, then according to synchronous flattening rule and hiding flattening rule to the expression in event
Formula and instruction are operated, synchronous event and hiding event after obtaining flattening.Specific algorithm pseudocode is as shown in Figure 5.
According to previously described step of the invention, steps are as follows for specific flattening:
1, to statement element D, C in main module BlockE、TMAnd AMCarry out the operation of flattening.Traverse the root of recursive tree
Node (main Block), according to the rule of flattening, D, TMAnd AMWithout adding prefix identifier, B can be directly introduced toflat
In, by CEIt is put into GetClassMap, class entitled key, corresponding value are the array of a random length, store repeatedly reference
Class Instance Name.Operate in submodule Block, definition data structure, by the detailed letter for the class quoted in Block
Breath is put into GetClassMap, and class name is as key, wherein since a class can be instantiated multiple times use, one
The corresponding value of key stores the different instantiation name of same referenced classes.
2, each straton module B is determinedsPrefix identifier.The submodule B for including in main moduleS, BSIt again may include BS,
Then a recursive tree is formed, most important work is exactly to wrap in the belonging relation of its determining hierarchical structure, such as Block b1
Contain Block b2, for component all in b2, their name, which is defined previously as " b1. " as prefix name, indicates affiliated pass
System.The level depth for first having to recurrence AST, as cycling condition, for each layer of BSIt is operated, since submodule can be into
Row multilayer nest, can act as the Instance Name of each layer of block the prefix identifier of next layer of Block, and prefix identifier can be with
The increase of the depth of nested structure and tree and successively recorded, use StringAppendBlockName () in algorithm
Method is recorded.
3, to statement element D, C in submodule BlockE、TSAnd ASCarry out the operation of flattening.Nested submodule
During iteration flattening, FlattenIncludeBlock () is a recursive function, is operated to all sub-blocks.Together
The prefix identifier of the Block child node of one Block root node be all it is identical, for each Block root node,
StringAppendBlockName () is unique, and is only worked in this subtree.At this point, can obtain each
The prefix identifier of each sub- Block of layer, utilizes AddPrefixIdentifierVarableAndEvent () method antithetical phrase
Statement element D in Block adds prefix identifier, and AddPrefixIdentifierTransition () is to each submodule
In TSAdd prefix identifier.AddPrefixIdentifierAssertion () is to the A in each submoduleSAdd prefix
Identifier, and the file after conversion is added to BflatIn.Again each layer of BSThe information of the class of reference is added to
In GetClassMap.
4, the flattening of the hierarchical structure of Class file.The AST for obtaining all Class, first according to previously described
Algorithm carries out flattening operation to the Block quoted in Class, the key of next GetClassMap obtained according to the algorithm,
Corresponding value under class name and the identical AST of key, and corresponding key is searched out, depth-first traversal is carried out to the AST, is obtained
Get D all in corresponding class, T, A；AddPrefixIdentifierVarableAndEvent (), method was in Class
State that element D adds prefix identifier, AddPrefixIdentifierTransition () adds the T in each Class
Prefix identifier, AddPrefixIdentifierAssertion () add prefix identifier to the A in each Class.
5, obtain the information of the Class of the reference of each Class file.The AST for traversing current Class is found current
The C of ClassEInformation repeats above-mentioned recursive function FlattenClass) process, do not quote other classes until finding
Class, recursive procedure terminate.
6, the normal event for including in synchronous event is taken out.TraversalIt is taken out according to the attribute of tree node therein
Synchronous event, it is [a in synchronous event e that taking out in synchronous event, which includes normal event,1... .., an, b1,... ..,
bm], it at this time can be directly by e, [a1... .., an, b1... .., bm] form be extended to map mapping, in the algorithm
Definition is mapGrandson for storing the strong and weak synchronous event for including in synchronous event and synchronous event.
7, the expression formula and command information that normal event includes are obtained.Pass through the normal event for including in mapGrandson
To syntax treeIt is traversed again, gets the content of strong and weak synchronous event, it is strong and weak according to the definition of transformation event
The content of synchronous event is directly made of expressions and instruction, get attribute be expressions and
The node of instruction, then traverses leaf node, gets the content for including, is deposited into mapSon.
8, the event after flattening is obtained.By synchronous flattening rule, be exactly in mapSon expressions and
Instruction carries out corresponding operation.TranslateSyncRule () (synchronous flat rule function) is utilized in algorithm
The content of mapSon is operated, the result of flattening is put into mapAll.The content of mapAll is traversed, and is carried out before
The file (not including the synchronous event of non-flattening) of level flattening merges, and can obtain the text of corresponding flattening
Part is carried out hiding operation accordingly again by the rule of hide, and flattening process is finished, and exports last flattening file.
It should be noted that the term of such as "upper", "lower", "left", "right", "front", "rear" cited in invention, also
Only being illustrated convenient for narration, rather than to limit the scope of the invention, relativeness is altered or modified, in nothing
Under essence change technology contents, when being also considered as the enforceable scope of the present invention.
The above is only the preferred embodiment of the present invention, protection scope of the present invention is not limited merely to above-described embodiment,
All technical solutions belonged under thinking of the present invention all belong to the scope of protection of the present invention.It should be pointed out that for the art
For those of ordinary skill, several improvements and modifications without departing from the principles of the present invention should be regarded as protection of the invention
Range.
Claims (6)
1. the method for transformation of the flattening of the AltaRica 3.0 based on ANTLR, which comprises the steps of:
Step 1: writing the ANTLR grammar file of AltaRica 3.0, corresponding abstract syntax tree is obtained；
Step 2: writing algorithm, AST is traversed, obtains the nodal value of AST, flat operation is carried out according to flattening algorithm.
2. the method for transformation of the flattening of the AltaRica 3.0 based on ANTLR as described in claim 1, it is characterised in that:
In the step 1, by the grammer supporting paper of AltaRica 3.0, AltaRica 3.0 is constructed using the metalanguage of ANTLR
ANTLR syntax parsing file, by run ANTLR built-in method, get the morphology and grammer solution of AltaRica 3.0
Parser obtains corresponding AST by inputting 3.0 example of AltaRica.
3. the method for transformation of the flattening of the AltaRica 3.0 based on ANTLR as described in claim 1, it is characterised in that:
In the step 2, the flattening layered of AltaRica 3.0 operation is pure Syntactic Manipulation, is made by main module Block
For the entrance of entire flattening process, multiple Block and multiple Class files establish its abstract syntax according to ANTLR respectively
Tree.
4. the method for transformation of the flattening of the AltaRica 3.0 based on ANTLR as claimed in claim 3, it is characterised in that:
In the step 2, flattening algorithm first divides 3.0 model file of AltaRica, finds out its main module
Block and submodule Block, and its all Class of reference, get multiple " .alt " files, in conjunction with AltaRica
3.0 ANTLR syntax parsing file, input file of " .alt " file as flattening algorithm, first to main module Block's
AST is analyzed, determine its reference all Class and it includes submodule Block, obtain the institute between hierarchical file
Category relationship, then in the operation to Class as submodule Block progress.
5. the method for transformation of the flattening of the AltaRica 3.0 based on ANTLR as claimed in claim 4, it is characterised in that:
In the step 2, flattening algorithm is to carry out continuous iterative process in following steps:
1) program entry of the main module Block as entire flattening process is got, the syntax tree of main module Block is carried out
Layering traversal, obtains the Class and submodule Block file of its nested first layer, and the Class information of reference is stored to right
In the map mapping answered, as the reference hierarchy information of next step Class syntax tree, while the word of a random length is defined
Symbol string s, the module name of upper one layer of Block is added in character string s, at this point, character string s is exactly the prefix mark of current Block
Know symbol, and the information of Block flattening is deposited into the flattening file B of storage BlockflatIn, level traversal is carried out again
And extreme saturation, repeat above-mentioned operation, until getting most deep node；
2) the Class information of the main module reference got according to step 1), traverses map, according to what is stored in map
Class class name and Instance Name, the AST file that Automatic-searching is established to corresponding Class file, Instance Name is exactly current at this time
The prefix identifier of Class, determines the belonging relation of Class, while obtaining the other Class of current Class file reference
The other Class class name and Instance Name of reference is stored in corresponding map, is repeating the above process, until true by the file information
The prefix identifier of fixed all Class.
6. the method for transformation of the flattening of the AltaRica 3.0 based on ANTLR as claimed in claim 5, it is characterised in that:
In the step 2, the hierarchical file of flattening is operated, the conversion information of this document includes three kinds of events: just
Ordinary affair part, synchronous event and hiding event, wherein synchronous event and hiding event include normal event；In flattening file
In the AST of formation, the type of corresponding event is directly acquired by the attribute of node, is obtained node in synchronous event and hiding event and is deposited
The value of storage, i.e., normal transformation event traverse AST further according to obtained value, obtain the expression formula and refer to that corresponding event includes
Enable, then according to synchronous flattening rule and hiding flattening rule in event expression formula and instruction operate, obtain
Synchronous event and hiding event after to flattening.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910158660.5A CN109857458B (en) | 2019-03-01 | 2019-03-01 | ANTLR-based AltaRica3.0 flattening transformation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910158660.5A CN109857458B (en) | 2019-03-01 | 2019-03-01 | ANTLR-based AltaRica3.0 flattening transformation method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109857458A true CN109857458A (en) | 2019-06-07 |
| CN109857458B CN109857458B (en) | 2021-04-27 |
Family
ID=66899719
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910158660.5A Active CN109857458B (en) | 2019-03-01 | 2019-03-01 | ANTLR-based AltaRica3.0 flattening transformation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109857458B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110716819A (en) * | 2019-10-10 | 2020-01-21 | 江苏科技大学 | AltaRica-based system fault tree automatic generation method |
| CN111984233A (en) * | 2020-08-03 | 2020-11-24 | 南京航空航天大学 | Class flattening method in AltaRica model |
| CN112115615A (en) * | 2020-09-21 | 2020-12-22 | 南京航空航天大学 | SCR-oriented safety key system model conversion method, device and system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100114885A1 (en) * | 2008-10-21 | 2010-05-06 | Microsoft Corporation | Query submission pipeline using linq |
| CN105808366A (en) * | 2016-03-14 | 2016-07-27 | 南京航空航天大学 | Four-variable model based system safety analysis method |
| CN105938502A (en) * | 2016-03-17 | 2016-09-14 | 南京航空航天大学 | Validation method for design of system security of AltaRica model |
| CN106776295A (en) * | 2016-11-30 | 2017-05-31 | 北京广利核系统工程有限公司 | A kind of software FMEA analysis methods based on Altarica Formal Languages |
| US20170236234A1 (en) * | 2016-02-12 | 2017-08-17 | Alstom Transport Technologies | Risk management method and system for a land transporation system |
-
2019
- 2019-03-01 CN CN201910158660.5A patent/CN109857458B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100114885A1 (en) * | 2008-10-21 | 2010-05-06 | Microsoft Corporation | Query submission pipeline using linq |
| US20170236234A1 (en) * | 2016-02-12 | 2017-08-17 | Alstom Transport Technologies | Risk management method and system for a land transporation system |
| CN105808366A (en) * | 2016-03-14 | 2016-07-27 | 南京航空航天大学 | Four-variable model based system safety analysis method |
| CN105938502A (en) * | 2016-03-17 | 2016-09-14 | 南京航空航天大学 | Validation method for design of system security of AltaRica model |
| CN106776295A (en) * | 2016-11-30 | 2017-05-31 | 北京广利核系统工程有限公司 | A kind of software FMEA analysis methods based on Altarica Formal Languages |
Non-Patent Citations (5)
| Title |
|---|
| MICHEL BATTEUX等: "Reliability Assessment of Phased-Mission Systems with AltaRica 3.0", 《2018 3RD INTERNATIONAL CONFERENCE ON SYSTEM RELIABILITY AND SAFETY (ICSRS)》 * |
| 仵志鹏: ""面向AltaRica模型的系统安全性设计验证方法研究"", 《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》 * |
| 石娇洁: "基于四变量模型的系统安全性建模与分析方法", 《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》 * |
| 胡军等: "AltaRica 3.0模型到Promela模型的转换与验证方法研究", 《计算机工程与科学》 * |
| 陈松: ""基于AltaRica的模型转换与安全性验证方法研究"", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110716819A (en) * | 2019-10-10 | 2020-01-21 | 江苏科技大学 | AltaRica-based system fault tree automatic generation method |
| CN111984233A (en) * | 2020-08-03 | 2020-11-24 | 南京航空航天大学 | Class flattening method in AltaRica model |
| CN111984233B (en) * | 2020-08-03 | 2022-02-01 | 南京航空航天大学 | Class flattening method in AltaRica model |
| CN112115615A (en) * | 2020-09-21 | 2020-12-22 | 南京航空航天大学 | SCR-oriented safety key system model conversion method, device and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109857458B (en) | 2021-04-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Elallaoui et al. | Automatic transformation of user stories into UML use case diagrams using NLP techniques | |
| Urban et al. | ATP and presentation service for Mizar formalizations | |
| Piskorski et al. | Shallow processing with unification and typed feature structures–foundations and applications | |
| CN111090461A (en) | Code annotation generation method based on machine translation model | |
| CN105701253A (en) | Chinese natural language interrogative sentence semantization knowledge base automatic question-answering method | |
| CN105706092B (en) | The method and system of four values simulation | |
| US20160275058A1 (en) | Method and system of text synthesis based on extracted information in the form of an rdf graph making use of templates | |
| CN101751385B (en) | Multilingual information extraction method adopting hierarchical pipeline filter system structure | |
| CN109857458A (en) | The method for transformation of the flattening of AltaRica 3.0 based on ANTLR | |
| CN103593335A (en) | Chinese semantic proofreading method based on ontology consistency verification and reasoning | |
| Pan et al. | Automatic repair of regular expressions | |
| CN110162297A (en) | A kind of source code fragment natural language description automatic generation method and system | |
| Lee | Building environment rule and analysis (BERA) language | |
| Verbitskaia et al. | Relaxed parsing of regular approximations of string-embedded languages | |
| CN112270175A (en) | ANTLR-based complex report formula analysis method and device | |
| Groz et al. | Deterministic regular expressions in linear time | |
| CN114528846A (en) | Concept network for artificial intelligence and generation method thereof | |
| CN101162480A (en) | Schedule drawing automatic recognition and comprehend method | |
| CN103678607B (en) | A kind of construction method of Emotion tagging system | |
| Wang et al. | Nlqxform: A language model-based question to sparql transformer | |
| Karmacharya et al. | Use of geospatial analyses for semantic reasoning | |
| Littell et al. | Gramble: A Tabular Programming Language for Collaborative Linguistic Modeling | |
| CN113468875A (en) | MNet method for semantic analysis of natural language interaction interface of SCADA system | |
| Rajbhoj et al. | DocToModel: Automated Authoring of Models from Diverse Requirements Specification Documents | |
| CN107341021B (en) | Software network representation, storage and retrieval method for large complex software with constraint logic attribute |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |