Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
A
adt2amas
Manage
Activity
Members
Labels
Plan
Issues
9
Issue boards
Milestones
Wiki
Code
Merge requests
0
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
PARTIES
tools
adt2amas
Graph
e199426ee144b001a4dccfc65b39befa1a9eba72
Select Git revision
Branches
3
develop
feature/electricity_theft_example
master
default
protected
Tags
7
v2.2.0
v2.1.3
v2.1.2
v2.1.1
v2.1.0
v2.0.0
v1.0.0
10 results
You can move around the graph by using the arrow keys.
Begin with the selected commit
Created with Raphaël 2.2.0
13
Sep
12
Feb
29
Jan
27
20
18
15
14
13
17
Dec
7
4
18
Nov
17
Oct
16
8
7
6
5
24
Aug
28
Jul
24
23
21
15
10
9
8
7
3
25
Jun
24
19
16
15
9
8
5
4
28
May
27
26
25
22
20
19
28
Apr
27
24
23
21
15
14
10
7
6
15
Dec
13
12
17
Oct
6
4
3
2
1
30
Sep
26
25
19
15
13
12
30
Aug
29
28
27
22
19
15
May
5
Dec
27
Nov
26
23
22
21
20
19
16
15
14
13
11
10
9
8
7
5
4
3
1
31
Oct
30
24
19
18
17
16
15
10
9
12
Sep
feature: translates the EAMAS model into the modgraph format
Merge branch 'develop'
v2.1.2
v2.1.2
doc: documentation of the new functions
Merge branch 'feature/or_strategy' into develop
fix: implement the strategy when there are OR gates
Merge branch 'develop'
v2.1.1
v2.1.1
rename assignment type into assignment_t
Merge branch 'feature/fix_sand_minimal' into develop
add comments to added code
remove comments
Implementation of the new algorithm for minimal scheduling
Merge branch 'develop'
v2.1.0
v2.1.0
Merge branch 'feature/layered_reductions' into develop
refactor all the code
refactor code
add layered reductions to cli
fix: copy guards and updates of the removed transition in the optimization
fix: include algorithm library
fix: unfold nok loop only if incoming transition has no the same action
update optimization of end loops in imitator parser
fix: return True as guard when empty vector of guards
remove transitions with label actions from t transitions
apply reduction to all depths
guards in automaton is a vector and not only one inequality
add method that updates transitions with depth variables
add method to ge the lst transitions
add method to get t transitions
add method to get the sync actions not found in the child
add funtion to get the sync actions of an automaton
add funtion to get the sync actions of an automaton
fix: add includes
add methods to calculate number of children in node and in depth
calculate depths and height of a sg tree
refactor project
refactor structure of the project
Merge branch 'develop'
v2.0.0
v2.0.0
fix: pointer error in translation for SAND gate
refactor: add generic exception class
update CLI11 library
fix: transform command load model from file
Loading