Bisimulation Relations Between Automata, Stochastic Differential Equations and Petri Nets

Details Bisimulation Relations Between Automata, Stochastic Differential Equations and Petri Nets Bisimulation Relations Between Automata, Stochastic Differential Equations and Petri Nets

2010-03-25

arxiv.org/abs/1003.4812v1

EPTCS 20, 2010, pp. 1-15

Computer Science

Logic in Computer Science

15 pages, 4 figures, Workshop on Formal Methods for Aerospace (FMA), EPTCS 20m 2010

Scientific paper

10.4204/EPTCS.20.1

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, stochastic differential equations on hybrid space and stochastic hybrid Petri nets. These bisimilarity relations make it possible to combine the formal verification power of automata with the analysis power of stochastic differential equations and the compositional specification power of Petri nets. The relations and their combined strengths are illustrated for an air traffic example.

Affiliated with

Also associated with

No associations

Rating

Bisimulation Relations Between Automata, Stochastic Differential Equations and Petri Nets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bisimulation Relations Between Automata, Stochastic Differential Equations and Petri Nets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bisimulation Relations Between Automata, Stochastic Differential Equations and Petri Nets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-556024