scientific article
From MaRDI portal
Publication:3823149
zbMath0669.68046MaRDI QIDQ3823149
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Petri netsconcurrencyconflict-freenessconcession rulenondistributive Muller-diagramsof self-timed circuitsself-timed VLSI- circuits
Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of software (68N99)
Related Items (4)
Asynchronous control device design by net model behavior simulation ⋮ A solution to the covering problem for 1-bounded conflict-free Petri nets using linear programming ⋮ Model checking using net unfoldings ⋮ A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets
This page was built for publication: