212 research outputs found
Hybrid modeling and optimization of biological processes
Proß S. Hybrid modeling and optimization of biological processes. Bielefeld: Bielefeld University; 2013
Translating synchronous Petri Nets into PROMELA for verifying behavioural properties
For developing embedded systems, the design process may benefit in some contexts from the usage of formal methods, namely to find critical errors and flaws, before final design and implementation decisions are taken. The Synchronous and Interpreted Petri Net (SIP-net) modelling language is considered in this article to model embedded systems. This model of computation is based on safe Petri nets with guarded transitions and synchronous transitions firing, and also includes enabling and inhibitor arcs. The Spin tool, whose input language is PROMELA, is a verification system based on model checking techniques. This article presents a program to translate SIP-net models into PROMELA code and discusses in detail the adequacy of the created PROMELA specification for verification through
model checking techniques.Fundação para a Ciência e a Tecnologia (FCT) - bolsa SFRH/BD/19718/200
Recent advances in petri nets and concurrency
CEUR Workshop Proceeding
Recommended from our members
A guided tour of P-Nut (Release 2.2)
P-NUT is a suite of tools for constructing and analyzing Petri Net models. The tools have been developed at UCI to aid researchers in applying Petri Nets to the design of concurrent hardware/software. The tools support state-space analysis, simulation, performance evaluation and verification. While the tools are useful in their current state, the P-NUT system is just beginning to achieve its overall objective of aiding in the design of complex distributed real-time systems. This report provides a guided tour of the tools for researchers who are interested in exploring P-NUT's capabilities
Maximally Parallel Multiset-Rewriting Systems: Browsing the Configurations
The aim of this research is to produce an algorithm for the software that
would let a researcher to observe the evolution of maximally parallel multiset-rewriting
systems with permitting and forbidding contexts, browsing the configuration space by
following transitions like following hyperlinks in the World-Wide Web.
The relationships of maximally parallel multiset-rewriting systems with other rewriting systems are investigated, such as Petri nets, different kinds of P systems, Lindenmayer
systems, grammar systems, regulated grammars
2008 Abstracts Collection -- IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
This volume contains the proceedings of the 28th international conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2008), organized under the auspices of the Indian Association for Research in Computing Science (IARCS)
Self-Evolving Petri Nets
Nowadays, software evolution is a very hot topic. It is particularly complex when it regards critical and nonstopping systems. Usually, these situations are tackled by hard-coding all the foreseeable evolutions in the application design and code.
Neglecting the obvious difficulties in pursuing this approach, we also get the application code and design polluted with details that do not regard the current system functionality, and that hamper design analysis, code reuse and application maintenance in general. Petri Nets (PN), as a formalism for modeling and designing distributed/concurrent software systems, are not exempt from this issue.
The goal of this work is to propose a PN based reflective framework that lets everyone model a system able to evolve, keeping separated functional aspects from evolutionary ones and applying evolution to the model only if necessary. Such an approach tries to keep system's model as simple as possible, preserving (and exploiting) ability of formally verifying system properties typical of PN, granting at the same time adaptability
- …