Yayın:
On achieving reachability paths of Petri nets

Sadeleştirilmiş öğe sayfası
dc.contributor.authorÖzkan, Hanife Apaydın
dc.contributor.orcid0000-0003-2932-0166
dc.date.accessioned2025-11-13T22:37:50Z
dc.date.issued2015-11-01
dc.identifier.doihttps://doi.org/10.1109/eleco.2015.7394484
dc.identifier.openalexW2276955912
dc.identifier.urihttps://hdl.handle.net/11421/14795
dc.identifier.urihttps://doi.org/10.1109/eleco.2015.7394484
dc.language.isoen
dc.rightsrestrictedAccess
dc.subjectReachability
dc.subjectPetri net
dc.subjectComputer science
dc.subjectStochastic Petri net
dc.subjectReachability problem
dc.subjectProcess architecture
dc.subjectTheoretical computer science
dc.subjectGraph
dc.subjectTree (set theory)
dc.subjectState (computer science)
dc.subjectPath (computing)
dc.subjectSet (abstract data type)
dc.subjectAlgorithm
dc.subjectProgramming language
dc.subjectMathematics
dc.titleOn achieving reachability paths of Petri nets
dc.typeArticle
dspace.entity.typePublication
local.authorid.openalexA5011581728

Dosyalar

Koleksiyonlar

Publications