首页> 外文会议>Concurrency theory >Unfoldifng and finite prefix for nets with read arcs

【24h】

Unfoldifng and finite prefix for nets with read arcs

机译：带有读弧的网络的展开和有限前缀

获取原文

获取原文并翻译 | 示例

页面导航

摘要
著录项
相似文献
相关主题

摘要

Petri nets with read arcs are investigated w.r.t their unfolding,where read arcs model reading without consuming,which is often more adequeate than the destructive-read-and-rewrite modelled with loops in ordinary nets.The paper redefines the concpets of a branchign process and unfolding ofr nets with read arcs and proves that the set of reachable markins of a net is commpletely represented by its unfolding.The specific feature of branchign processes of nets with read arcs is that the notion of a co-set is no longer based only on hte brinary concurrency realtion betwene the elements of the unfolding,ocntrary to ordinary nets.

机译：研究带有读取弧的Petri网络的展开过程，其中读取弧模型无需消耗即可读取数据，这比普通网络中以循环建模的破坏性读取和重写更为确定。本文重新定义了分支过程的概念，并带有读弧的网络的展开，并证明网的可到达标记集完全由其展开表示。带有读弧的网络的分支过程的特定特征是，陪集的概念不再仅基于并发实现在普通网之外的要素之间。

著录项

来源
《Concurrency theory》|1998年|p.501-516|共16页
会议地点 Nice(FR);Nice(FR)
作者
Walter Vogler; Alex Semenov; Alex Yakovlev;
展开▼
作者单位

展开▼
会议组织
原文格式 PDF
正文语种 eng
中图分类自动化技术、计算机技术;
关键词
asynchronous circuits; branching processes; concurrency semantics; hazards; Petri nets with read rarcs; read-persistence; unfolding;

机译：异步电路分支过程；并发语义；危害带有稀有度的Petri网；读取持久性展开;

相似文献

外文文献
中文文献
专利

1. FFcPsA: a fast finite conventional state using prefix pattern gene search algorithm for large sequence identification [J] . Surendar A., Arun M., Basha A. Mahabub Soft computing: A fusion of foundations, methodologies and applications . 2019,第8期

机译：FFCPSA：使用前缀模式基因搜索算法进行大型序列识别的快速有限常规状态
2. Domain and event structure semantics for Petri nets with read and inhibitor arcs [J] . Baldan P, Busi N, Corradini A, Theoretical computer science . 2004,第1a3期

机译：具有读取和禁止弧的Petri网的域和事件结构语义
3. Diagnosis of three types of constant faults in read-once contact networks over finite bases [J] . Busbait Monther, Moshkov Mikhail Theoretical computer science . 2016,第Null期

机译：一次有限接触的一次接触网络中三种恒定故障的诊断
4. Unfoldifng and finite prefix for nets with read arcs [C] . Walter Vogler, Alex Semenov, Alex Yakovlev International conference on concurrency theory . 1998

机译：读取弧的网的展开和有限前缀
5. FINITE CONDUCTIVITY AND THE RAYLEIGH-TAYLOR INTERCHANGE INSTABILITY, WITH APPLICATIONS TO PLASMA ARCS IN ELECTROMAGNETIC RAIL-LAUNCH DEVICES (FLUTE, RAIL GUNS). [D] . DECKER, ANN MARIE. 1986

机译：有限的电导率和Rayleigh-Taylor交换不稳定性，及其在电磁轨道发射装置（排屑管，轨道枪）中的等离子弧度中的应用。
6. Selection of marker genes for genetic barcoding of microorganisms and binning of metagenomic reads by Barcoder software tools [O] . Adeola M. Rotimi, Rian Pierneef, Oleg N. Reva 2018

机译：通过Barcoder软件工具选择用于微生物遗传条形码和宏基因组读取分箱的标记基因
7. Unfolding and Finite Prefix for Nets with Read Arcs [O] . Walter Vogler, Alex Semenov, Alex Yakovlev 2008

机译：具有读取弧的网络的展开和有限前缀
8. Separate Write and Read Access Architecture for a Magnetic Tunnel Junction. [R] . Katti, R. R. 2004

机译：用于磁隧道结的独立写和读访问架构。

Unfoldifng and finite prefix for nets with read arcs

摘要

著录项

相似文献

相关主题

期刊订阅