Properties of Conflict-Free and Persistent Petri Nets

DOI10.1145/322077.322079zbMath0384.68062OpenAlexW1966992415MaRDI QIDQ4164838

Lawrence H. Landweber, Edward L. Robertson

Publication date: 1978

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: http://digital.library.wisc.edu/1793/57970

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (46)

REGULAR STATE MACHINES ⋮ Sufficient conditions for the marked graph realisability of labelled transition systems ⋮ Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states ⋮ An \(O(n^{1.5})\) algorithm to decide boundedness for conflict-free vector replacement systems ⋮ Petri Nets and Semilinear Sets (Extended Abstract) ⋮ Step Persistence in the Design of GALS Systems ⋮ Execution termination and computation determinacy of data-flow program nets ⋮ Performance evaluation of concurrent systems using conflict-free and persistent Petri nets ⋮ Deciding a class of path formulas for conflict-free Petri nets ⋮ Completeness results for conflict-free vector replacement systems ⋮ Deterministic asynchronous interpretation of parallel microprograms ⋮ Problems concerning fairness and temporal logic for conflict-free Petri nets ⋮ Linear time analysis of properties of conflict-free and general Petri nets ⋮ The decidability of persistence for vector addition systems ⋮ A Note on Persistent Petri Nets ⋮ Decomposition Theorems for Bounded Persistent Petri Nets ⋮ Persistence of vector replacement systems is decidable ⋮ Unfolding-based dynamic partial order reduction of asynchronous distributed programs ⋮ On weak persistency of Petri nets ⋮ The complexity of problems involving structurally bounded and conservative Petri nets ⋮ A unified approach for deciding the existence of certain petri net paths ⋮ On structural conditions for weak persistency and semilinearity of Petri nets ⋮ Complexity results for 1-safe nets ⋮ Characterisation of the state spaces of marked graph Petri nets ⋮ A solution to the covering problem for 1-bounded conflict-free Petri nets using linear programming ⋮ Synthesis of Persistent Systems ⋮ Normal and sinkless Petri nets ⋮ Synthesis and reengineering of persistent systems ⋮ Unnamed Item ⋮ Complexity of some problems in Petri nets ⋮ Bounded choice-free Petri net synthesis: algorithmic issues ⋮ An extension of the taxonomy of persistent and nonviolent steps ⋮ Asynchrony and persistence in reaction systems ⋮ Abstract processes and conflicts in place/transition systems ⋮ A decomposition theorem for finite persistent transition systems ⋮ Presynthesis of bounded choice-free or fork-attribution nets ⋮ Characterising Petri Net Solvable Binary Words ⋮ PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS ⋮ Target-oriented Petri Net Synthesis ⋮ Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets ⋮ Normal Petri nets ⋮ Observable liveness of Petri nets ⋮ A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets ⋮ Conditions for Petri Net Solvable Binary Words ⋮ A valuation-based analysis of conflict-free Petri nets ⋮ Analysis of a class of communicating finite state machines

This page was built for publication: Properties of Conflict-Free and Persistent Petri Nets