Cited By
View all- Merlin P(1979)Specification and Validation of ProtocolsIEEE Transactions on Communications10.1109/TCOM.1979.109432327:11(1671-1680)Online publication date: Nov-1979
In [1] GOSTELOW-VAN WEERT, it was shown that processes can be described by Petri-nets (PN). In this note we will demonstrate a way of designing programs using Petri-nets as a way of describing the desired behavior. This approach makes it possible to ...
In [1] GOSTELOW-VAN WEERT, it was shown that processes can be described by Petri-nets (PN). In this note we will demonstrate a way of designing programs using Petri-nets as a way of describing the desired behavior. This approach makes it possible to ...
A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by Allouche and Shallit as a generalization of automatic sequences. Given a ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in