Counter-Constrained Finite State Machines: A New Model for Component Protocols with Resource-Dependencies

DOI10.1007/3-540-36137-5_2zbMath1278.68034OpenAlexW1871553649MaRDI QIDQ3085976

Ralf H. Reussner

Publication date: 1 April 2011

Published in: SOFSEM 2002: Theory and Practice of Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-36137-5_2

zbMATH Keywords

substitutabilityinteroperabilitydecidable inclusion checkfinite state machine extensionsoftware component protocols

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Network protocols (68M12)

This page was built for publication: Counter-Constrained Finite State Machines: A New Model for Component Protocols with Resource-Dependencies