This paper deals with the reachability analysis of {P,A}-Time Petri nets ({P,A}-TPN in short) in the context of strong semantics. It investigates the convexity of the union of state classes reached by different interleavings of the same set of transitions. In [6], the authors have considered the T-TPN model and its Contracted State Class Graph (CSCG) [7] and shown that this union is not necessa...

Critical real-time embedded systems (RTES) crucially have strong requirement concerning system’s reliability. UML and its profile MARTE are standardized modeling language that are getting widely accepted by industrial designers to cope with the development of complex RTSE. In Model-driven engineering, verification at early phases of the system lifecycle is an important problem, which remains op...

Abstract. This report describes a method for building the state class graph of a bounded time Petri net (TPN) as a timed automaton (TA). We consider bounded TPN, whose underlying net is not necessarily bounded. We prove that the obtained TA is timed-bisimilar to the initial TPN. The number of clocks of the automaton is much lower than with other methods available. We have implemented the method...

The paper describes a transformational approach for the specification and formal verification of concurrent and real-time systems. At upper level, one system is specified using the timed process algebra RT-LOTOS. The output of the proposed transformation is a Time Petri net (TPN). The paper particularly shows how a TPN can be automatically constructed from an RT-LOTOS specification using a comp...

This paper describes an approach to the analysis of time-dependent systems which combines discrete-event simulation and model-checking techniques. The approach rests on Merlin and Farber’s Time Petri Nets (TimePNs) and is supported by a Java toolbox TPN Designer which enables graphical modelling, simulation and translation into UPPAAL/Timed Automata, for exhaustive state space verification, of ...

The theory of Petri Nets provides a general framework to specify the behaviors of real-time reactive systems and Time Petri Nets were introduced to take also temporal specifications into account. We present in this paper a forward zone-based algorithm to compute the state space of a bounded Time Petri Net: the method is different and more efficient than the classical State Class Graph. We prove...

In this paper, we consider the time Petri net model (TPN model) and show how to detect zenoness using the state class method. Zenoness is a situation which suggests that an infinity of actions may take place in a finite amount of time. This behavior is often considered as pathological since it violates a fundamental requirement for timed systems for they cannot be infinitely fast. Models violat...

Ladder Diagram (LD) is the most used programming language for Programmable Logical Controllers (PLCs). A PLC is a special purpose industrial computer used to automate industrial processes. Bugs in LD programs are very costly and sometimes are even a threat to human safety. We propose a model driven approach for formal verification of LD programs through model-checking. We provide a metamodel fo...

Software architecture is one of the most fundamental products in the process of software development in the areas of behavioral or non- behavioral features like availability or transformability change. There are different ways to evaluate software architecture one of which is the creation of application model. An executable model of software architecture is an official description of architectu...

This paper presents a simulation of an ambulatory processes using timed Petri net (TPN). The considers the flow patients in biggest Brazilian cardiology hospital. TPN is used as decision support system (DSS) to improve processes, reduce waiting time and this way assure high-quality service patients. Simulations were carried out software Visual Object Net++. free therefore presented solution low...