Wyniki wyszukiwania - BazTech

1

Activity Networks with Delays an Application to Toxicity Analysis

Delaplace F., Di Giusto C., Giavitto J. -L, Klaudel H., Spicher A.

Fundamenta Informaticae

|

2018

|

Vol. 160, nr 1/2

119--142

EN

ANDy, Activity Networks with Delays, is a discrete framework aiming at the qualitative modeling of time-dependent activities. The modular and expressive syntax makes ANDy suitable for a concise and natural modeling of time-dependent biological systems (i.e., regulatory pathways). Activities involve entities playing the role of activators, inhibitors or products of biochemical network operation. Activities may have a given duration, i.e., the time required to obtain results. An entity may represent an object (e.g., an agent, a biochemical species or a family of thereof) with a local attribute, a state denoting its level (e.g., concentration, strength). Entity levels may change as a result of an activity or may decay gradually as time passes by. The semantics of ANDy is formally given via high-level Petri nets ensuring this way some modularity. As main results we show that ANDy systems have finite state representations even for potentially infinite processes and it well adapts to the modeling of toxic behaviors. As an illustration, we present a classification of toxicity properties and give some hints on how they can be verified on ANDy systems with existing tools. A case study on blood glucose regulation is provided to exemplify the ANDy framework and the toxicity properties.

2

A Petri Net Interpretation of Open Reconfigurable Systems

Peschanski F., Klaudel H., Devillers R.

Fundamenta Informaticae

|

2013

|

Vol. 122, nr 1-2

85--117

EN

We present a Petri net interpretation of the pi-graphs - a graphical variant of the picalculus where recursion and replication are replaced by iteration. The concise and syntax-driven translation can be used to reason in Petri net terms about open reconfigurable systems. We demonstrate that the pi-graphs and their translated high-level Petri nets agree at the semantic level. In consequence, existing results on pi-graphs naturally extend to the translated Petri nets, most notably a guarantee of finiteness by construction.

3

Petri Net Semantics of the Finite p-calculus Terms

Devillers R., Klaudel H., Koutny M.

Fundamenta Informaticae

|

2006

|

Vol. 70, nr 3

203-226

EN

In this paper we propose a translation into high level Petri nets of the terms of a finite fragment of the p-calculus. Our construction renders in a compositional way the control flow aspects present in p-calculus process expressions, by adapting the existing graph-theoretic net composition operators. Those aspects which are related to term rewriting, as well as name binding, are handled through special inscriptions of places, transitions and arcs, together with a suitable choice of the initial marking.

4

Synchronous and Asynchronous Communications in Composable Parameterized High-Level Petri Nets

Devillers R., Klaudel H.

Fundamenta Informaticae

|

2005

|

Vol. 66, nr 3

221--257

EN

In the domain of parameterized composable high-level Petri nets (M-nets), we shall combine the refinement, the synchronization and the asynchronous link operations in a unified and general setup, while keeping the expected properties of those operations. In particular, the various high-level net operations are consistent through unfolding with their low-level counterparts, and the usual commutativity and idempotency properties are fulfilled at the syntactic level up to structural equivalences.

5

Asynchronous Box Calculus

Devillers R., Klaudel H., Koutny M., Pommereau F.

Fundamenta Informaticae

|

2003

|

Vol. 54, nr 4

295-344

EN

The starting point of this paper is an algebraic Petri net framework allowing one to express net compositions, such as iteration and parallel composition, as well as transition synchronisation and restriction. We enrich the original model by introducing new constructs supporting asynchronous interprocess communication. Such a communication is made possible thanks to special `buffer' places where different transitions (processes) may deposit and remove tokens. We also provide an abstraction mechanism, which hides buffer places, effectively making them private to the processes communicating through them. We then provide an algebra of process expressions, whose constants and operators directly correspond to those used in the Petri net framework. Such a correspondence is used to associate nets to process expressions in a compositional way. That the resulting algebra of expressions is consistent with the net algebra is demonstrated by showing that an expression and the corresponding net generate isomorphic transition systems. This results in the Asynchronous Box Calculus (or ABC), which is a coherent dual model, based on Petri nets and process expressions, suitable for modelling and analysing distributed systems whose components can interact using both synchronous and asynchronous communication.

6

A Class of Composable and Preemptible High-level Petri Nets with an Application to Multi-Tasking Systems

Klaudel H., Pommereau F.

Fundamenta Informaticae

|

2002

|

Vol. 50, nr 1

33-55

EN

This paper presents an extension of an algebra of high-level Petri nets with operations for suspension and abortion. These operations are sound with respect to the semantics of preemption, and can be applied to the modelling of the semantics of high-level parallel programming languages with preemption-related features. As an illustration, the paper gives an application to the modelling of a multi-tasking system in a parallel programming language, which is provided with a concurrent semantics based on Petri nets and for which implemented tools can be used.