MARCIE – Model Checking and Reachability Analysis Done Efficiently

Heiner, Monika; Röhr, Christian; Schwarick, Martin

doi:10.1007/978-3-642-38697-8_21

Cited by 53 publications

(41 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Snoopy [25] is a java-based graphical interface which includes token animation. Marcie [26] is a set of analysis algorithms for various forms of stochastic Petri nets. These algorithms implement CTL and CSL model-checking as well as CTMC solution and stochastic simulation of the net.…”

Section: Literature Reviewmentioning

confidence: 99%

30 Years of GreatSPN

Amparore

Balbo

Beccuti

et al. 2016

Springer Series in Reliability Engineering

View full text Add to dashboard Cite

GreatSPN is a tool for the stochastic analysis of systems modelled as (stochastic) Petri nets. This chapter describes the evolution of the GreatSPN framework over its lifespan of 30 years, from the first stochastic Petri net analyzer implemented in Pascal, to the current, fancy, graphical interface that supports a number of different model analyzers. This chapter reviews, with the help of a manufacturing system example, how GreatSPN is currently used for an integrated qualitative and quantitative analysis of Petri net systems, ranging from symbolic model checking techniques to a stochastic analysis whose efficiency is boosted by lumpability.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

30 Years of GreatSPN

Amparore

Balbo

Beccuti

et al. 2016

Springer Series in Reliability Engineering

View full text Add to dashboard Cite

show abstract

“…The CTL model checking approaches are based on the work of Ciardo [28] and the bounded model checking approach is the extension of [27]. The LTL model checking algorithms are built on top of the ideas of [11,14]. Our research resulted in significant extensions and improvements, this way PetriDotNet currently supports novel analysis algorithms as follows:…”

Section: Saturation-based Model Checking Algorithmsmentioning

confidence: 99%

PetriDotNet 1.5: Extensible Petri Net Editor and Analyser for Education and Research

Vörös

Darvas

Molnár

et al. 2016

Application and Theory of Petri Nets and Concurrency

View full text Add to dashboard Cite

Abstract.PetriDotNet is an extensible Petri net editor and analysis tool originally developed to support the education of formal methods. The ease of use and simple extensibility fostered more and more algorithmic developments. Thanks to the continuous interest of developers (especially M.Sc. and Ph.D. students who choose PetriDotNet as the framework of their thesis project), by now PetriDotNet became an analysis platform, providing various cutting-edge model checking algorithms and stochastic analysis algorithms. As a result, industrial application of the tool also emerged in recent years. In this paper we overview the main features and the architecture of PetriDotNet, and compare it with other available tools.

show abstract

“…We use three modelling and analysis tools to perform computational experiments, namely Marcie [25], PRISM [34] and Cosmos [3,4]. We also use Graphviz for the visualisation of Petri nets.…”

Section: Toolsmentioning

confidence: 99%

On Quantitative Modelling and Verification of DNA Walker Circuits Using Stochastic Petri Nets

Barbot¹,

Kwiatkowska²

2015

Application and Theory of Petri Nets and Concurrency

View full text Add to dashboard Cite

Abstract. Molecular programming is an emerging field concerned with building synthetic biomolecular computing devices at the nanoscale, for example from DNA or RNA molecules. Many promising applications have been proposed, ranging from diagnostic biosensors and nanorobots to synthetic biology, but prohibitive complexity and imprecision of experimental observations makes reliability of molecular programs difficult to achieve. This paper advocates the development of design automation methodologies for molecular programming, highlighting the role of quantitative verification in this context. We focus on DNA 'walker' circuits, in which molecules can be programmed to traverse tracks placed on a DNA origami tile, taking appropriate decisions at junctions and reporting the outcome when reaching the end of the track. The behaviour of molecular walkers is inherently probabilistic and thus probabilistic model checking methods are needed for their analysis. We demonstrate how DNA walkers can be modelled using stochastic Petri nets, and apply statistical model checking using the tool Cosmos to analyse the reliability and performance characteristics of the designs. The results are compared and contrasted with those obtained for the PRISM model checker. The paper ends by summarising future research challenges in the field.

show abstract

MARCIE – Model Checking and Reachability Analysis Done Efficiently

Cited by 53 publications

References 19 publications

30 Years of GreatSPN

30 Years of GreatSPN

PetriDotNet 1.5: Extensible Petri Net Editor and Analyser for Education and Research

On Quantitative Modelling and Verification of DNA Walker Circuits Using Stochastic Petri Nets

Contact Info

Product

Resources

About