On the regularity of Petri net languages

DOI10.1006/inco.1996.0013zbMath0853.68138OpenAlexW2073941363MaRDI QIDQ1917074

Hsu-Chun Yen

Publication date: 3 July 1996

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1996.0013

zbMATH Keywords

concurrent systemsPetri netsregularity problem

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Proving safety properties of infinite state systems by compilation into Presburger arithmetic ⋮ ON YEN'S PATH LOGIC FOR PETRI NETS ⋮ On Yen’s Path Logic for Petri Nets

This page was built for publication: On the regularity of Petri net languages