Bisimulation Relations Between Automata, Stochastic Differential Equations and Petri Nets
نویسندگان
چکیده
منابع مشابه
Bisimulation Relations Between Automata, Stochastic Differential Equations and Petri Nets
Two formal stochastic models are said to be bisimilar if their solutions as a stochastic process are probabilistically equivalent. Bisimilarity between two stochastic model formalisms means that the strengths of one stochastic model formalism can be used by the other stochastic model formalism. The aim of this paper is to explain bisimilarity relations between stochastic hybrid automata, stocha...
متن کاملPetri nets and resource bisimulation
Resources are defined as submultisets of Petri net markings. Two resources are called similar if replacing one of them by another in any marking doesn’t change the Petri net’s behavior. We define the relations of resource similarity and resource bisimulation and show that they are finitely based. In this paper the resource bisimulation is studied for different classes of Petri nets: ordinary Pe...
متن کاملBisimulation and the Reduction of Petri Nets
We investigate structural equivalences on places of P/T nets that allow reductions compatible with bisimilarity. This comes with a study of two kinds of reductions: fusion of equivalent places, and replacement of some places by other ones. When eeectivity issues are considered, we are lead to a variant of place bisimulation that takes into account a set of \relevant" markings.
متن کاملParallel Simulation of Stochastic Petri Nets Using Recursive Equations Parallel Simulation of Stochastic Petri Nets Using Recurrence Equations
A new parallel simulation method is proposed for the class of stochastic decision free Petri nets, that is amenable to an SIMD implementation. This method is based on the max; +-linear structure of recurrence equations that were established for this type of systems. Two variants are analyzed, the spatial and the temporal methods. The spatial method allows one to simulate large networks. The tem...
متن کاملPushdown automata, multiset automata, and Petri nets
In this paper, we consider various classes of (in)nite-state) automata generated by simple rewrite transition systems. These classes are de)ned by two natural hierarchies, one given by interpreting concatenation of symbols in the rewrite system as sequential composition, and the other by interpreting concatenation as parallel composition. In this way, we provide natural definitions for commutat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2010
ISSN: 2075-2180
DOI: 10.4204/eptcs.20.1