Protocol synthesis and re-synthesis with optimal allocation of resources based on extended Petri nets

DOI10.1007/S00446-002-0074-4zbMATH Open1448.68170OpenAlexW2003887790MaRDI QIDQ5138481FDOQ5138481

Authors: Hirozumi Yamaguchi, Khaled El-Fakih, Gregor von Bochmann, Teruo Higashino 

Publication date: 4 December 2020

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-002-0074-4

Recommendations

• The synthesis of communication protocols
• scientific article; zbMATH DE number 1418467
• Distributing finite automata through Petri net synthesis
• The synthesis problem
• Comments on deriving protocol specifications from service specifications written in LOTOS

zbMATH Keywords

distributed systemPetri netprotocol specificationprotocol synthesisprotocol re-synthesisservice specification

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Distributed systems (68M14) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Deriving protocol specifications from service specifications written in LOTOS
• Deriving protocol specifications from service specifications written as Predicate/Transition-nets

Cited In (4)

• The synthesis of communication protocols
• Decomposing service definition in predicate/transition-nets for designing distributed systems
• Protocol analysis and synthesis by structured partitions
• Synthesizing distributed protocol specifications from a UML state machine modeled service specification

This page was built for publication: Protocol synthesis and re-synthesis with optimal allocation of resources based on extended Petri nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138481)