z-logo
open-access-imgOpen Access
A graph theoretical characterization of minimal deadlocks in Petri nets
Author(s) -
JeanClaude Bermond,
Gérard Memmi
Publication year - 1985
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - petri net , computer science , graph , programming language , process architecture , theoretical computer science , distributed computing

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom