38 research outputs found

    Petri nets for systems and synthetic biology

    Get PDF
    We give a description of a Petri net-based framework for modelling and analysing biochemical pathways, which uniÂŻes the qualita- tive, stochastic and continuous paradigms. Each perspective adds its con- tribution to the understanding of the system, thus the three approaches do not compete, but complement each other. We illustrate our approach by applying it to an extended model of the three stage cascade, which forms the core of the ERK signal transduction pathway. Consequently our focus is on transient behaviour analysis. We demonstrate how quali- tative descriptions are abstractions over stochastic or continuous descrip- tions, and show that the stochastic and continuous models approximate each other. Although our framework is based on Petri nets, it can be applied more widely to other formalisms which are used to model and analyse biochemical networks

    ML-Space: hybrid spatial Gillespie and Brownian motion simulation at multiple levels, and a rule-based description language

    Get PDF
    Computer simulations of biological cells as well-stirred systems are well established but neglect the spatial distribution of key actors. In this thesis, a simulation algorithm "ML-Space" for spatial models with dynamic hierarchies is presented. It combines stochastic spatial algorithms in discretized space with individual particles moving in continuous space that have spatial extensions and can contain other particles. For formal descriptions of the systems to be simulated spatially, ML-Space provides a rule-based specification language.Computersimulationen mikrobiologischer Prozesse, bei denen eine homogene Verteilung der Akteure einer Zelle angenommen wird, sind gut etabliert. In dieser Arbeit wird ein rĂ€umlicher Simulationsalgorithmus "ML-Space" fĂŒr Mehrebenenmodelle vorgestellt, der auch dynamische Hierarchien abdeckt. Er vereint stochastische rĂ€umliche Algorithmen in diskretisiertem Raum mit individuellen Partikeln mit kontinuierlichen Koordinaten, die andere Partikel enthalten können. Zur formalen Beschreibung der rĂ€umlich zu simulierenden Systeme bietet ML-Space eine regelbasierte Modellierungssprache

    Tools and Algorithms for the Construction and Analysis of Systems

    Get PDF
    This book is Open Access under a CC BY licence. The LNCS 11427 and 11428 proceedings set constitutes the proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2019, which took place in Prague, Czech Republic, in April 2019, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019. The total of 42 full and 8 short tool demo papers presented in these volumes was carefully reviewed and selected from 164 submissions. The papers are organized in topical sections as follows: Part I: SAT and SMT, SAT solving and theorem proving; verification and analysis; model checking; tool demo; and machine learning. Part II: concurrent and distributed systems; monitoring and runtime verification; hybrid and stochastic systems; synthesis; symbolic verification; and safety and fault-tolerant systems

    Hybrid modeling and optimization of biological processes

    Get PDF
    Proß S. Hybrid modeling and optimization of biological processes. Bielefeld: Bielefeld University; 2013

    Contribution à la Spécification et à la Vérification des Exigences Temporelles (Proposition d'une extension des SRS d'ERTMS niveau 2)

    Get PDF
    Les travaux dĂ©veloppĂ©s dans cette thĂšse visent Ă  assister le processus d ingĂ©nierie des exigences temporelles pour les systĂšmes complexes Ă  contraintes de temps. Nos contributions portent sur trois volets : la spĂ©cification des exigences, la modĂ©lisation du comportement et la vĂ©rification. Pour le volet spĂ©cification, une nouvelle classification des exigences temporelles les plus communĂ©ment utilisĂ©es a Ă©tĂ© proposĂ©e. Ensuite, afin de cadrer l utilisateur durant l expression des exigences, une grammaire de spĂ©cification Ă  base de motifs prĂ©dĂ©finis en langage naturel est dĂ©veloppĂ©e. Les exigences gĂ©nĂ©rĂ©es sont syntaxiquement prĂ©cises et correctes quand elles sont prises individuellement, nĂ©anmoins cela ne garantie pas la cohĂ©rence de l ensemble des exigences exprimĂ©es. Ainsi, nous avons dĂ©veloppĂ© des mĂ©canismes capables de dĂ©tecter certains types d incohĂ©rences entre les exigences temporelles. Pour le volet modĂ©lisation du comportement, nous avons proposĂ© un algorithme de transformation des state-machine avec des annotations temporelles en des automates temporisĂ©s. L idĂ©e Ă©tant de manipuler une notation assez intuitive et de gĂ©nĂ©rer automatiquement des modĂšles formels qui se prĂȘtent Ă  la vĂ©rification. Finalement, pour le volet vĂ©rification, nous avons adoptĂ© une technique de vĂ©rification Ă  base d observateurs et qui repose sur le model-checking. ConcrĂštement, nous avons Ă©laborĂ© une base de patterns d observation (ou observateurs) ; chacun des patterns dĂ©veloppĂ©s est relatif Ă  un type d exigence temporelle dans la nouvelle classification. Ainsi, la vĂ©rification est rĂ©duite Ă  une analyse d accessibilitĂ© des Ă©tats correspondants Ă  la violation de l exigence associĂ©eThe work developed in this thesis aims to assist the engineering process of temporal requirements for time-constrained complex systems. Our contributions concern three phases: the specification, the behaviour modelling and the verification. For the specification of temporal requirements, a new temporal properties typology taking into account all the common requirements one may meet when dealing with requirements specification, is introduced. Then, to facilitate the expression, we have proposed a structured English grammar. Nevertheless, even if each requirement taken individually is correct, we have no guarantee that a set of temporal properties one may express is consistent. Here we have proposed an algorithm based on graph theory techniques to check the consistency of temporal requirements sets. For the behaviour modelling, we have proposed an algorithm for transforming UML State Machine with time annotations into Timed Automata (TA). The idea is to allow the user manipulating a quite intuitive notation (UML SM diagramsduring the modelling phase and thereby, automatically generate formal models (TA) that could be used directly by the verification process. Finally, for the verification phase, we have adopted an observer-based technique. Actually, we have developed a repository of observation patterns where each pattern is relative to a particular temporal requirement class in our classification. Thereby, the verification process is reduced to a reachability analysis of the observers KO states relatives to the requirements violationVILLENEUVE D'ASCQ-ECLI (590092307) / SudocSudocFranceF

    Computational modelling of mycobacterium infection and innate immune response in zebrafish

    Get PDF
    In this thesis we provided a comprehensive overview on the steps that are involved in the modeling process and simulation of biological phenomena; from the choice of the method to the validation of the results. We gradually implemented a model with which we would be able to study the complex interplay of the components involved in the Mycobacterium marinum infection process and innate immune response in zebrafish embryos. In itself this process is a model for deeper understanding of tuberculosis infection in humans using zebrafish as model organism. Each chapter is a building block in the modeling process, which gradually forms a model that can represent cause-and-effect among these components involved in the biological behavior.Computer Systems, Imagery and Medi

    Tools and Algorithms for the Construction and Analysis of Systems

    Get PDF
    This open access book constitutes the proceedings of the 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2022, which was held during April 2-7, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 46 full papers and 4 short papers presented in this volume were carefully reviewed and selected from 159 submissions. The proceedings also contain 16 tool papers of the affiliated competition SV-Comp and 1 paper consisting of the competition report. TACAS is a forum for researchers, developers, and users interested in rigorously based tools and algorithms for the construction and analysis of systems. The conference aims to bridge the gaps between different communities with this common interest and to support them in their quest to improve the utility, reliability, exibility, and efficiency of tools and algorithms for building computer-controlled systems
    corecore