Abstract
The sequential calculus SFM (acronym of Sequential Finite-state Machines) is equipped with an operational LTS semantics and an operational Petri net semantics; we observe that the two semantics are essentially isomorphic. We prove that all and only the sequential finite-state machines are the models of the Petri net semantics for SFM. Moreover, a denotational net semantics is presented and proved to be the same as the operational net semantics.
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
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Gorrieri, R. (2017). The Basic Calculus: SFM. In: Process Algebras for Petri Nets. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Cham. https://doi.org/10.1007/978-3-319-55559-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-55559-1_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-55558-4
Online ISBN: 978-3-319-55559-1
eBook Packages: Computer ScienceComputer Science (R0)