Прога / tina-2.5.2 / README

WHAT IS TINA :
--------------

Tina (TIme petri Net Analyzer) is  a toolbox for the analysis of Petri
Nets and Time Petri Nets. At that time, it includes:

tina : construction of reachability graphs.
~~~~~~

Depending upon the  option retained, builds (references at  the end of
file):

The coverability graph of a Petri net, by the Karp and Miller technique.

The  markings reachability  graph of  a  Petri net  (untimed, or  with
timing information discarded).

The covering  step graph  of a Petri  net, according to  the technique
introduced in (5), preserving various properties.

The partial marking  graph of a Petri net  according to the persistent
sets method,  as well as  three experimental variants of  it combining
persistent sets and covering steps, described in (8).

The graph  of state classes of  a Time Petri net,  using the technique
introduced   in  references   (1)  and   (2).  This   graph  preserves
reachability properties and linear time temporal properties.

As above, with interpretation of multi-enabledness (as in (6)).

The graph of "atomic" classes of a Time Petri net, under an improvemnt
of  a construction  proposed  in  (4), described  in  (7). This  graph
preserves liveness properties and branching time temporal properties.

struct :  structural analysis of Petri nets.
~~~~~~~~ 

Determines  the  invariance  and  consistence properties  for  a  net,
computes the generator sets for semi-flows on places and transitions.

nd (NetDraw) : Time Petri net and Automata editor.
~~~~~~~~~~~~~~


WHERE TO FIND TINA :
--------------------

The latest version of Tina may be downloaded from thw web page:
 
        http://www.laas.fr/tina

There are three distributions there :

	tina-2.X.Y-i386-linux.tar.gz	for PCs under Linux
	tina-2.X.Y-i386-mswin.tar.gz	for PCs under Windows or NT
	tina-2.X.Y-sparc.tar.gz		for Sun stations under SunOS 5.X

These  are binary distributions,  currently. Source  distributions are
scheduled shortly.


INSTALLATION :
--------------

See file INSTALL for installation notes.


USAGE :
-------

See file doc/tina.txt.


CONTACT :
---------

For any comments, bug reports  or specific demands, contact the author
(e-mail: Bernard.Berthomieu@laas.fr).


REFERENCES :
------------

(1) B.  Berthomieu, M. Menasche, An Enumerative Approach for Analyzing
    Time Petri Nets, IFIP Congress 1983, Paris, 1983.

(2) B.   Berthomieu,  M.   Diaz,  Modeling and  verification  of  time
    dependent  systems using  time Petri  nets.  IEEE  Transactions on
    Software Engineering, 17(3), 1991.

(3) B.  Berthomieu, La mйthode  des classes d'йtats pour l'analyse des
    rйseaux    Temporels,   Mise   en    oeuvre,   extension    а   la
    multi-sensibilisation, MSR'2001, to appear.

(4) T. Yoneda, H.  Ryuba, CTL Model Checking of  Time Petri Nets using
    Geometric  Regions,  IEICE Transactions  on  Inf.  and Syst.,  vol
    E99-D, No 3, March 1998.

(5) F. Vernadat, P. Azйma, F. Michel, Covering Step Graph, Application
    and Theory of Petri Nets 96, Springer Verlag LNCS 1091, 1996.

(6) B. Berthomieu, La mйthode des Classes d'йtats pour l'Analyse des Rйseaux
    Temporels - Mise en Oeuvre, Extension а la multi-sensibilisation.
    Modйlisation des Systиmes Rйactifs, MSR'2001, Hermes, 2001.

(7) B. Berthomieu, F. Vernadat, State class constructions for branching 
    analysis of Time Petri nets. LAAS Report 02045, 2002. (submitted)

(8) P-O. Ribet, F. Vernadat, B. Berthomieu, On Combining the Persistent Set
    Method with the Covering Step Graph Method. LAAS Report 02045, 2002.
    (to appear at FORTE'2002).