Eclipse Community Forums: ATL » computing the time complexity of the atl transformation rules

Home » Modeling » ATL » computing the time complexity of the atl transformation rules(how computing the time complexity of the atl transformation rules)

Show: Today's Messages :: Show Polls :: Message Navigator

computing the time complexity of the atl transformation rules [message #1804334]

Fri, 22 March 2019 15:23

Cristina Redriguez

Messages: 10
Registered: February 2017

Junior Member

Hi,

My goal is to check the quality of my transformation rules. That's why I had the idea to calculate its complexity. I don't know if it's possible because I spent a lot of time researching how the complexity of an ATL program is calculated. Unfortunately, I did not find any idea. I would be grateful if someone help me.

[Updated on: Fri, 22 March 2019 15:24]

Report message to a moderator

Re: computing the time complexity of the atl transformation rules [message #1805928 is a reply to message #1804334]

Sun, 28 April 2019 16:13

Dennis Wagelaar

Messages: 581
Registered: September 2012
Location: Belgium

Senior Member

The time complexity order is not defined by the ATL language. Instead, it is determined by the VM implementation and/or compiler implementation. This currently comes down to O(n^x) for matched rules, where x is the number of input elements. For all other ATL code, you need to determine yourself how often it is invoked.

Cheers,
Dennis

Report message to a moderator

Previous Topic:	open ATL editor programmatically
Next Topic:	Problem with a simple transformation using EMFTVM

Goto Forum:

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

]

Current Time: Sat Nov 11 08:19:59 GMT 2023

.:: Contact :: Home ::.

Breadcrumbs

Sign up to our Newsletter