Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas (Q334220): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 93C30 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 93B40 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C59 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C09 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6645994 / rank | |||
Normal rank |
Revision as of 04:46, 28 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas |
scientific article |
Statements
Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas (English)
0 references
1 November 2016
0 references