On Well-Formed Coloured Nets and Their Symbolic Reachability Graph

Chiola, Giovanni; Dutheillet, Claude; Franceschinis, Giuliana; Haddad, Serge

doi:10.1007/978-3-642-84524-6_13

Cited by 96 publications

(61 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to be able to capture a higher number of symmetries for more complex systems, we may think of changing the underlying model of our semantics in favor of more appropriate models for which reduced state space construction methods have been already proposed. For instance, we may think of mapping EMPA gr terms onto stochastic well formed nets (SWNs) [12] or stochastic activity networks (SANs) [23]. As an example, in a random polling system there might be a customer that is faster than the others.…”

Section: Resultsmentioning

confidence: 99%

Integrating TwoTowers and GreatSPN through a compact net semantics

Bernardo

Busi

Ribaudo

2002

Performance Evaluation

View full text Add to dashboard Cite

Stochastic process algebras (SPAs) and stochastic Petri nets (SPNs) are two well known formal methods for the functional and performance modeling and analysis of computer, communication and software systems. Starting from the mappings from process algebras to Petri nets proposed in the literature to provide a truly concurrent semantic framework to concurrent programming languages, in this paper we define a new SPN semantics for SPAs in order to facilitate the integration and the cross fertilization between the two formalisms. We then prove that our net semantics is correct via a retrievability result. Afterwards, we demonstrate that it improves on the previously proposed net semantics with respect to the size of the resulting SPNs and on the standard interleaving semantics because of the detection of system symmetries. Furthermore, we illustrate its usefulness by showing how to reinterpret at the SPA level the results efficiently obtainable at the SPN level. Finally, we describe the implementation of our net semantics that has been realized to integrate the EMPA gr based software tool TwoTowers with the GSPN based software tool GreatSPN.

show abstract

Section: Resultsmentioning

confidence: 99%

Integrating TwoTowers and GreatSPN through a compact net semantics

Bernardo

Busi

Ribaudo

2002

Performance Evaluation

View full text Add to dashboard Cite

show abstract

“…The number of output tokens may differ from the number of input tokens and they may have data values which are of different types. 6 The other three transitions work in a similar way. The two transitions to the right use two different variables, s and r. Each of these must be bound to a value in DBM.…”

Section: Informal Introduction To Cp-netsmentioning

confidence: 93%

An Introduction to the Theoretical Aspects of Coloured Petri Nets

Jensen¹

1994

DPB

View full text Add to dashboard Cite

This paper presents the basic theoretical aspects of Coloured Petri Nets (CP-nets or CPN). CP-nets have been developed, from being a promising theoretical model, to being a full-fledged language for the design, specification, simulation, validation and implementation of large software systems (and other systems in which human beings and/or computers communicate by means of some more or less formal rules). The paper contains the formal definition of CP-nets and their basic concepts (e.g., the different dynamic properties such as liveness and fairness). The paper also contains a short introduction to the analysis methods, in particular occurrence graphs and place invariants.The development of CP-nets has been driven by the desire to develop a modelling language -at the same time theoretically well-founded and versatile enough to be used in practice for systems of the size and complexity that we find in typical industrial projects. To achieve this, we have combined the strength of Petri nets with the strength of programming languages. Petri nets provide the primitives for the description of the synchronisation of concurrent processes, while programming languages provide the primitives for the definition of data types and the manipulation of their data values.The paper does not assume that the reader has any prior knowledge of Petri nets -although such knowledge will, of course, be a help.

show abstract

“…Here, we will not present in detail these algorithms, since they can be found in (Chiola et al, 1991). We just note that this computation is organized in two steps: Fig.…”

Section: Canonisation Of Arcsmentioning

confidence: 99%

“…Secondly, we propose to optimise the first approach in order to deal efficiently with symmetric systems. Indeed, the reachability graph of a symmetric system can be represented by an optimised version, called symbolic reachability graph (Chiola et al, 1991;, which is quite smaller. Thereby, the use of symbolic graphs allows to alleviate one important drawback of the latter approach which is the well-known problem of the state space explosion.…”

Section: Introductionmentioning

confidence: 99%