Modeling and Analysis of Real-Time Cooperative Systems Using Petri Nets

Du, Yu; Jiang, Congying; Zhou, Meng Chu

doi:10.1109/tsmca.2007.902622

Cited by 72 publications

(22 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Their method uses simple time Petri nets to analyze concurrent software systems developed in Ada. There are many previous efforts for formal modeling and analysis of various systems using Petri nets [11,12,13,14,15].…”

Section: Related Workmentioning

confidence: 99%

Internet Host Reliability Modeling with Time Petri Nets

Meligy¹,

Ibrahim²,

Aqlan³

2012

IJCA

View full text Add to dashboard Cite

Understanding the reliability of components is important for modeling the reliability of a distributed system. Careful modeling allows the construction of highly fault-tolerant distributed data applications and less expensive. Petri nets have been extensively used in the modeling and analysis of concurrent and distributed systems. Particular importance of Petri nets are in the development of concurrent and distributed systems. One of the standard concepts of time-dependent Petri nets is the one, where each transition gets a continuous time interval, specifying the range of the transition"s reaction time.

show abstract

Section: Related Workmentioning

confidence: 99%

Internet Host Reliability Modeling with Time Petri Nets

Meligy¹,

Ibrahim²,

Aqlan³

2012

IJCA

View full text Add to dashboard Cite

show abstract

“…Furthermore, instead of providing quantitative analysis of system reliability directly using Petri nets, our approach currently focuses on using colored Petri nets (CPN) [31] to verify the correctness of a DRBD model, namely the safety properties and liveness properties [32] of the corresponding system. Although there are many previous efforts for formal modeling and analysis of various systems using Petri nets [33][34][35][36][37], automated system modeling using colored Petri nets is rare. As we demonstrate in the case study in Section V, it is vital to provide an automated mechanism to ensure the correctness of a DRBD model because a DRBD model can become complicated when dynamic reliability properties are involved.…”

Section: Related Workmentioning

confidence: 99%

Automated Modeling of Dynamic Reliability Block Diagrams Using Colored Petri Nets

Robidoux

Xing

et al. 2010

IEEE Trans. Syst., Man, Cybern. A

124

View full text Add to dashboard Cite

Abstract-Computer system reliability is conventionally modeled and analyzed using techniques such as fault tree analysis (FTA) and reliability block diagrams (RBD), which provide static representations of system reliability properties. A recent extension to RBD, called dynamic reliability block diagrams (DRBD), defines a framework for modeling dynamic reliability behavior of computer-based systems. However, analyzing a DRBD model in order to locate and identify design errors, such as a deadlock error or faulty state, is not trivial when done manually. A feasible approach to verifying it is to develop its formal model, and then analyze it using programmatic methods. In this paper, we first define a reliability markup language (RML) that can be used to formally describe DRBD models. Then we present an algorithm that automatically converts a DRBD model into a colored Petri net (CPN). We use a case study to illustrate the effectiveness of our approach and demonstrate how system properties of a DRBD model can be verified using an existing Petri net tool. Our formal modeling approach is compositional, thus it provides a potential solution to automated verification of DRBD models. Index Terms-System

show abstract

“…Studies of real-time distributed systems reveal a number of challenges, including load balancing [13], resource management [14], [36], security [15], [33], availability [34], cooperative systems [35], scheduling mechanisms [37], and fault tolerance [18]- [22]. Fault tolerance is an inherent requirement of modern real-time systems, which can be implemented in both hardware and software.…”

Section: Related Workmentioning

confidence: 99%

Exploiting Redundancies to Enhance Schedulability in Fault-Tolerant and Real-Time Distributed Systems

Luo

Qin

Tan

et al. 2009

IEEE Trans. Syst., Man, Cybern. A

View full text Add to dashboard Cite

Abstract-In the past decades, distributed systems have been widely applied to real-time applications, most of which have fault-tolerance requirements to assure high reliability. Due to the stringent space constraints of real-time systems, the issue of schedulability becomes a major concern in the design of faulttolerant and real-time distributed systems. Most existing real-time and fault-tolerant scheduling algorithms, which are based on the primary-backup scheme for periodic real-time tasks, introduce unnecessary redundancies by aggressively using active-backup copies. To solve this problem, we propose two novel fault-tolerant techniques, which are seamlessly integrated with fixed-prioritybased scheduling algorithms. These techniques leverage redundancies to enhance schedulability in fault-tolerant and real-time distributed systems. Our fault-tolerant techniques make use of the primary-backup scheme to tolerate permanent hardware failures. The first technique (referred to as Tercos) terminates the execution of active-backup copies, when corresponding primary copies are successfully completed. Tercos is designed to reduce scheduling lengths in fault-free scenarios to enhance schedulability by virtue of executing portions of active-backup copies in passive forms. The second technique (referred to as Debus) uses a deferred-active-backup scheme to further minimize schedule lengths to improve the schedulability performance. Debus schedules active-backup copies as late as possible, while terminating active-backup copies when their primary copies are completed. Experimental results show that, compared with existing algorithms in literature, Tercos can significantly improve schedulability by up to 17.0% (with an average of 9.7%). Furthermore, empirical results reveal that Debus can enhance schedulability over Tercos by up to 12% (with an average of 7.8%).

show abstract

Modeling and Analysis of Real-Time Cooperative Systems Using Petri Nets

Cited by 72 publications

References 16 publications

Internet Host Reliability Modeling with Time Petri Nets

Internet Host Reliability Modeling with Time Petri Nets

Automated Modeling of Dynamic Reliability Block Diagrams Using Colored Petri Nets

Exploiting Redundancies to Enhance Schedulability in Fault-Tolerant and Real-Time Distributed Systems

Contact Info

Product

Resources

About