Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.lang.pascal.misc > #2572

Tina and Partial order reduction techniques..

Show all headers | View raw

Hello..


Read this:


Tina and Partial order reduction techniques..

With the advancement of computer technology, highly concurrent systems 
are being developed. The verification of such systems is a challenging 
task, as their state space grows exponentially with the number of 
processes. Partial order reduction is an effective technique to address 
this problem. It relies on the observation that the effect of executing 
transitions concurrently is often independent of their ordering.

Tina is using “partial-order” reduction techniques aimed at preventing 
combinatorial explosion, Read more here to notice it:

http://projects.laas.fr/tina/papers/qest06.pdf

About modelizations and detection of race conditions and deadlocks in 
parallel programming..

I have just taken further a look at the following project in Delphi 
called DelphiConcurrent by an engineer called Moualek Adlene from France:

https://github.com/moualek-adlene/DelphiConcurrent/blob/master/DelphiConcurrent.pas

And i have just taken a look at the following webpage of Dr Dobb's journal:

Detecting Deadlocks in C++ Using a Locks Monitor

https://www.drdobbs.com/detecting-deadlocks-in-c-using-a-locks-m/184416644


And i think that both of them are using technics that are not as good
as analysing deadlocks with Petri Nets in parallel applications ,
for example the above two methods are only addressing locks or mutexes
or reader-writer locks , but they are not addressing semaphores
or event objects and such other synchronization objects, so they
are not good, this is why i have written a tutorial that shows my 
methodology of analysing and detecting deadlocks in parallel 
applications with Petri Nets, my methodology is more sophisticated 
because it is a generalization and it modelizes with Petri Nets the 
broader range of synchronization objects, and in my tutorial i will add 
soon other synchronization objects, you have to look at it, here it is:

https://sites.google.com/site/scalable68/how-to-analyse-parallel-applications-with-petri-nets

You have to get the powerful Tina software to run my Petri Net examples 
inside my tutorial, here is the powerful Tina software:

http://projects.laas.fr/tina/

Also to detect race conditions in parallel programming you have to take 
a look at the following new tutorial that uses the powerful Spin tool:

https://mirrors.edge.kernel.org/pub/linux/kernel/people/paulmck/perfbook/perfbook.html

This is how you will get much more professional at detecting deadlocks 
and race conditions in parallel programming.


Thank you,
Amine Moulay Ramdane.

Back to comp.lang.pascal.misc | Previous | Next | Find similar

Thread

Tina and Partial order reduction techniques.. Wisdom90 <d@d.d> - 2020-01-25 13:46 -0500

csiph-web