Abstract
If the transitions of a Petri net are associated with the letters of some alphabet, then the firing sequences correspond to words over that alphabet. The set of firing sequences is clearly prefix-closed, but if a notion of final state (in addition to the initial marking) is also introduced, some interesting, not necessarily prefixclosed, sets of accepted words (i.e., languages) can be investigated. In this chapter, the languages which arise through such an extension are characterised.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Best, E., Devillers, R. (2024). Languages of Petri Nets. In: Petri Net Primer. Computer Science Foundations and Applied Logic. Birkhäuser, Cham. https://doi.org/10.1007/978-3-031-48278-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-031-48278-6_2
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-031-48277-9
Online ISBN: 978-3-031-48278-6
eBook Packages: Computer ScienceComputer Science (R0)