@incollection{eprints284,
           pages = {54--70},
          volume = {1},
            year = {2008},
           title = {TAPAs: A Tool for the Analysis of Process Algebras},
          series = {Lecture Notes in Computer Science},
          author = {Francesco Calzolai and Rocco De Nicola and Michele Loreti and Francesco Tiezzi},
         journal = {T. Petri Nets and Other Models of Concurrency},
       publisher = {Springer},
          editor = {Kurt Jensen and Wil M. P. van der Aalst and Jonathan Billington},
       booktitle = {Transactions on Petri Nets and Other Models of Concurrency I},
        keywords = {concurrency - property verification - process algebras - bisimulation - behavioural equivalences - modal logics },
             url = {http://eprints.imtlucca.it/284/},
        abstract = {Process algebras are formalisms for modelling concurrent systems that permit mathematical reasoning with respect to a set of desired properties. TAPAs is a tool that can be used to support the use of process algebras to specify and analyze concurrent systems. It does not aim at guaranteeing high performances, but has been developed as a support to teaching. Systems are described as process algebras terms that are then mapped to labelled transition systems (LTSs). Properties are verified either by checking equivalence of concrete and abstract systems descriptions, or by model checking temporal formulae over the obtained LTS. A key feature of TAPAs, that makes it particularly suitable for teaching, is that it maintains a consistent double representation of each system both as a term and as a graph. Another useful didactical feature is the exhibition of counterexamples in case equivalences are not verified or the proposed formulae are not satisfied.}
}