Article: Maria: Modular Reachability Analyser for Algebraic System Nets

Author:
Marko Mäkelä
Published in:
Javier Esparza and Charles Lakos, editors, Applications and Theory of Petri Nets 2002, 23rd International Conference, ICATPN 2002, Adelaide, Australia, June 2002, Proceedings, volume 2360 of Lecture Notes in Computer Science, Springer-Verlag, Berlin
Pages:
434–444
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.


Available in electronic form