论文标题
培养皿网络编程
Petri Nets for Concurrent Programming
论文作者
论文摘要
并发编程用于所有大型和复杂的计算机系统。但是，并发错误和系统故障（例如：崩溃和僵局）很常见。我们发现，培养皿可用于建模并发系统，并提前查找和删除错误。我们引入了具有非确定性过渡节点的培养皿网的新颖概括，以匹配实际系统。这些允许一种紧凑的方法来构建，优化和证明并发级别的计算机程序。 Petri Net程序也可以通过自动求解最大并发性来优化，其中有效线程的最大数量由执行前PETRI NET的结构确定。我们讨论一种算法来计算给定的培养皿网状状态对的状态图。我们介绍了我们的开源软件框架，该框架将该理论作为一种以通用并发为中心的中间软件。
Concurrent programming is used in all large and complex computer systems. However, concurrency errors and system failures (ex: crashes and deadlocks) are common. We find that Petri nets can be used to model concurrent systems and find and remove errors ahead of time. We introduce a novel generalization of Petri nets with nondeterministic transition nodes to match real systems. These allow for a compact way to construct, optimize, and prove computer programs at the concurrency level. Petri net programs can also be optimized by automatically solving for maximal concurrency, where the maximum number of valid threads is determined by the structure of the Petri net prior to execution. We discuss an algorithm to compute the state graph of a given Petri net start state pair. We introduce our open source software framework which implements this theory as a general purpose concurrency focused middle-ware.
