Reachability graph (RG) generation suffers from the problem of exponential space and time complexity. To alleviate the more critical problem of time complexity, this paper presents the new approach for RG generation for the Petri net (PN) models of parallel processes. Independent RGs for each parallel process in the PN structure are generated in parallel and cross-product of these RGs turns int...

This study aims to automate the simulation of activity diagram (AD) in accordance with the OMG SysML specifications. We use the concept of model-driven engineering to transform AD into VHDL-AMS. This transformation is depicted in two transformations based on specifications given by the Object Management Group (OMG): Activity Diagram (AD) to Petri net (PN) and PN to VHDL-AMS. We have established...

Petri net models are useful tools for the modelling of discrete event systems and hybrid systems. This paper is about the parameters estimation for two classes of timed PN: Ttimed Petri nets and continuous Petri nets with variable speeds. The parameters to be estimated are either incidence, either temporal parameters. Data based and model based methods are proposed. In each case, on line and of...

In this paper we present a translation from the object-based language OB(PN) 2 to a class of high-level Petri nets. The OB(PN) 2 language is an extension of B(PN) 2 as deened by Best and Hopkins, and the semantics is inspired by the B(PN) 2 semantics deened in terms of M-nets. The translation relies on the CCS-like composition operators deened for M-nets. Each program construct is translated to...

Integrating Object Oriented (OO) modeling language and Petri Net (PN) modeling is important to gather complementary benefits of these two modeling languages. OO technology is used to describe the static aspects of systems because of its powerful structuring capabilities, whereas PN is used to model the behavioral aspects for concurrent and non deterministic applications. PN is an executable mod...

This paper presents the syntax of a concurrent programming notation which integrates a variety of process interaction techniques, its compositional Petri net semantics via the Box calculus, and an example of using the semantics for program verification.

Veriication of parallel programs is a very important goal on the way to improve the reliability of software. The PEP tool, a Programming Environment based on Petri nets, allows veriication of parallel programs by partial order model checking based on a compositional denotational Petri net semantics. The language supported by the PEP tool covers block structuring, parallel and sequential composi...

Using a class of high level Petri nets, M-nets, endowed with composition operators resembling those of CCS, we give the compositional semantics of B(PN) a syntactically simple but semantically powerful concurrent programming language. We also give an associated low level net semantics and show the consistency of these high and low level semantics, as well as consistency with a previously define...

Using a class of high level Petri nets, M-nets, endowed with composition operators resembling those of CCS, we give the compositional semantics of B(PN) 2-a syntactically simple but semantically powerful concurrent programming language. We also give an associated low level net semantics and show the consistency of these high and low level semantics , as well as consistency with a previously dee...