Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas (Q334220): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Algorithmic graph schemes and transition graphs: Their application in software realization of logical control algorithms. II / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity of automaton identification from given data / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Exact DFA Identification Using SAT Solvers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Manipulating LTL Formulas Using Spot 1.0 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1134/s0005117916030097 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2317988951 / rank | |||
Normal rank | |||
Latest revision as of 12:04, 30 July 2024
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
