形式语言与自动机_笔记整理(六)_Petri网与时间自动机

最新推荐文章于 2024-06-28 00:19:05 发布

Vitalia

最新推荐文章于 2024-06-28 00:19:05 发布

阅读量3.4k

点赞数 1

分类专栏：理论基础文章标签： Petri-net 时间自动机

本文链接：https://blog.csdn.net/Vitalia/article/details/78944520

版权

本文深入探讨了Petri网及其在并发系统建模中的应用。Petri网是一种图形与数学工具，用于表示资源和状态转换。其特点包括异步状态转移、并发性和同步行为。此外，文章还介绍了有限容量Petri网的概念，以及如何通过权重解决容量约束。接着，文章转向时间自动机，讨论了时钟约束和定时自动机的语义与可达性问题。这些概念对于理解分布式系统的复杂行为至关重要。

摘要由CSDN通过智能技术生成

Petri Net

In contrast to state machines, state transitions in Petri nets are asynchronous. The ordering of transitions is partly uncoordinated; it is specified by a partial order.

Therefore, Petri nets can be used to model concurrent distributed systems.

Petri Nets: Graphical and Mathematical modeling tools

graphical tool
mathematical tool

The graphical presentation of a Petri net is a bipartite graph.

There are two kinds of nodes

Places: usually model resources or partial state of the system
Transitions: model state transition and synchronization.
Arcs are directed and always connect nodes of different types
Tokens are resources in the places.

Definition of Petri Net

$C = ( P, T, I, O)$
Places 
$P = { p_1, p_2, p_3, …, p_n}$
Transitions 
$T = { t_1, t_2, t_3, …, t_n}$
Input  
I : $T\rightarrow P^r$ (r = number of places) $\cdot t$
Output 
O : $T \rightarrow P^q$ (q = number of places) $t\cdot$
marking
µ : assignment of tokens to the places of Petri net $µ = µ_1, µ_2, µ_3, … µ_n$

这里写图片描述

Petri net consist two types of nodes: places and transitions. And arc exists only from a place to a transition or from a transition to a place.
A place may have zero or more tokens.

Fire

A transition t is called enabled in a certain marking, if:
For every arc from a place p to t, there exists a distinct token in the marking
An enabled transition can fire and result in a new marking
Firing of a transition t in a marking is an atomic operation

Firing a transition results in two things:

Subtracting one token from the marking of any place p for every arc connecting p to t
Adding one token to the marking of any place p for every arc connecting t to p

Run-1 Safe PN

A run of a Petri net is a finite or infinite sequence of markings and transitions $\mu_0 \xrightarrow {t_0} \mu_1\xrightarrow {t_1}\cdots \xrightarrow{t_{n-1}} \mu_n\xrightarrow{t_n} \cdots$ such that $\mu_0$ is the initial marking of the net, $t_i ∈ enabled(\mu_i)$ for any i (i ≥ 0) , and that μi=(μi−1−⋅t