Liveness-Preserving Simulation Relations1
نویسنده
چکیده
We present a simulation-based proof method for liveness properties. Our method is based on simulation relations LV93] that relate the liveness properties of an implementation to those of the speciication. Even though reasoning about liveness is usually associated with reasoning over entire executions, variant functions, fairness etc., our method requires reasoning over individual states/transitions only. It thus presents a signiicant methodological advance over current methods.
منابع مشابه
On the Importance of the Deadlock Trap Property for Monotonic Liveness
In Petri net systems, liveness is an important property capturing the idea of no transition (action) becoming non-fireable (unattainable). Additionally, in some situations it is particularly interesting to check if the net system is (marking) monotonically live, i.e., it remains live for any marking greater than the initial one. In this paper, we discuss structural conditions preserving livenes...
متن کاملExtension of the PESIM simulation tool
The paper describes the use of the particular transformations between Petri nets, called reductions, in the analysis process for Petri nets. Reduction methods reduce the graph of the net by agglomeration of place nodes and transition nodes. The reductions transform one net into another, preserving some dynamical properties of Petri nets such as liveness, boundedness or invariants. Then the stan...
متن کاملBehavioural and Structural Composition Rules Preserving Liveness by Synchronization for Colored FIFO Nets
This paper deals with the compositionality of liveness when synchronizing two coloured FIFO nets. The composition operator allows to merge transitions as well as some adjacent places or queues. A behavioural suucient condition for liveness compositionality relies on a mutual non constraining relation between component nets. A structural suucient condition for synchronization preserving liveness...
متن کاملLiveness-Preserving Atomicity Abstraction
Modern concurrent algorithms are usually encapsulated in libraries, and complex algorithms are often constructed using libraries of simpler ones. We present the first theorem that allows harnessing this structure to give compositional liveness proofs to concurrent algorithms and their clients. We show that, while proving a liveness property of a client using a concurrent library, we can soundly...
متن کاملOn the Refinement of Liveness Properties of Distributed Systems1
We present a new approach for reasoning about liveness properties of distributed systems, represented as automata. Our approach is based on simulation relations, and requires reasoning only over finite execution fragments. Current simulation-relation based methods for reasoning about liveness properties of automata require reasoning over entire executions, since they involve a proof obligation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999