Analysis of an Ada system using coloured Petri nets and occurrence graphs

McLendon, William W.; Vidale, Richard F.

doi:10.1007/3-540-55676-1_24

Cited by 9 publications

(2 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Neither has it been possible to give a comprehensive description of the tool support. Reports on a number of case studies can be found in [1], [2], [3], [4], [5], [8], [11], [17], [20], [22], [27], [32], [36], [40], [42] and [43]. Nearly all the case studies have been conducted in an in-dustrial setting.…”

Section: Resultsmentioning

confidence: 99%

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

Section: Resultsmentioning

confidence: 99%

An Introduction to the Theoretical Aspects of Coloured Petri Nets

Jensen¹

1994

DPB

View full text Add to dashboard Cite

show abstract

“…There have been many industrial applications of CPN (Jensen, 1997, Chapter 7). CPN can be used to model and verify systems in many research areas, including communication protocols (Floreani et al, 1996;Huber, 1991), software system designs (McLendon and Vidale, 1992;Scheschonk and Timpe, 1994), and cryptographic protocols (Aly and Mustafa, 2004).…”

Section: Related Workmentioning

confidence: 99%

A user-centric federated single sign-on system

Suriadi¹,

Foo²,

Jøsang³

2009

Journal of Network and Computer Applications

View full text Add to dashboard Cite

a b s t r a c t Current identity management systems are not concerned with user privacy. Users must assume that identity providers and service providers will ensure their privacy, which is not always the case. This paper proposes an extension of the existing federated single sign-on (FSSO) systems that adopts the beneficial properties of the user-centric identity management (UCIM) model. This new identity management system allows the users to control and enforce their privacy requirements while still retaining the convenience of single sign-on over a federation of service providers. Colored Petri Nets are used to formally model the new identity management system to provide assurance that the privacy goals are achieved. To our knowledge, Colored Petri Nets have not been used to model privacy in identity management systems before.

show abstract