Last update: Thu Sep 27 02:46:39 MDT 2018
@Article{Araki:1977:DPS,
author = "T. Araki and T. Kasami",
title = "Decidable problems on the strong connectivity of
{Petri} net reachability sets",
journal = j-THEOR-COMP-SCI,
volume = "4",
number = "1",
pages = "99--119",
month = feb,
year = "1977",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1975.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Information and Computer Sci., Faculty of
Engng. Sci., Osaka Univ., Toyonaka, Osaka, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computability and decidability; decidable; Petri net;
reachability sets; strong connectivity",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}