Maria: Modular Reachability Analyser for Algebraic System Nets

Reference:

Marko Mäkelä. Maria: Modular reachability analyser for algebraic system nets. In Javier Esparza and Charles Lakos, editors, Application and Theory of Petri Nets 2002: 23^rd International Conference, ICATPN 2002, number 2360 in Lecture Notes in Computer Science, pages 434–444, Adelaide, Australia, June 2002. Springer-Verlag, Berlin, Germany.

Abstract:

Maria performs simulation, exhaustive reachability analysis and on-the-fly LTL model checking of high-level Petri nets with fairness constraints. The algebra contains powerful built-in data types and operations. Models can be exported to low-level Petri nets and labelled transition systems. Translator programs allow Maria to analyse transition systems as well as distributed computer programs written in procedural or object-oriented languages, or high-level specifications such as SDL. Maria has been implemented in portable C and C++, and it is freely available under the conditions of the GNU General Public License.

Suggested BibTeX entry:

@inproceedings{MakelaMarko-Makela:maria,
    address = {Adelaide, Australia},
    author = {Marko M{\"a}kel{\"a}},
    booktitle = {Application and Theory of Petri Nets 2002: 23\textsuperscript{rd} International Conference, ICATPN 2002},
    editor = {Javier Esparza and Charles Lakos},
    month = {June},
    number = {2360},
    pages = {434--444},
    publisher = {Springer-Verlag, Berlin, Germany},
    series = {Lecture Notes in Computer Science},
    title = {Maria: Modular Reachability Analyser for Algebraic System Nets},
    year = {2002},
}