Analysis issues in Petri nets with inhibitor arcs

DOI10.1016/S0304-3975(01)00127-XzbMath1026.68097MaRDI QIDQ1606123

Nadia Busi

Publication date: 31 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

model checking problemP/T systems with inhibitor arcs

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (11)

Interpreted synchronous extension of time Petri nets. Definition, semantics and formal analysis ⋮ Reduction rules for reset/inhibitor nets ⋮ Petri nets for modelling metabolic pathways: a survey ⋮ Reconfigurable Petri Nets with Transition Priorities and Inhibitor Arcs ⋮ A PO characterisation of reconfiguration ⋮ Step coverability algorithms for communicating systems ⋮ A survey of gene regulatory networks modelling methods: from differential equations, to Boolean and qualitative bioinspired models ⋮ Property analysis of logic Petri nets by marking reachability graphs ⋮ Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS ⋮ A theory of structural stationarity in the \(\pi\)-calculus ⋮ Nadia Busi's publications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity results for 1-safe nets
• A calculus of mobile processes. II
• On the expressiveness of Linda coordination primitives.
• Contextual nets
• Decidability of model checking for infinite-state concurrent systems
• Semantics of inhibitor nets
• Parallel program schemata
• An Algorithm for the General Petri Net Reachability Problem
• Free Choice Petri Nets
• Computability of Recursive Functions

This page was built for publication: Analysis issues in Petri nets with inhibitor arcs