Publication

A Petri Net based approach for modelling multi-layered distributed protocols

1996
Conference Papers

Abstract

A Petri Net based approach for modelling multi-layered distributed protocols N. Sergent This paper presents an original modelling approach which aims to provide probabilistic guarantees on time in asynchronous distributed systems for several important algorithms, like consensus and atomic broadcast. The modelling framework is based on Hierarchical Coloured Timed Petri Nets (HCTPN). Simulation is used not only to find statistical upper bounds on the termination time of these algorithms but also to study the influence of the Fault Detectors parameters and to obtain optimal values for them.

Official source

https://infoscience.epfl.ch/entities/publication/996de319-aa33-4386-b183-7229bd09fdc6

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

1996
Conference Papers

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/996de319-aa33-4386-b183-7229bd09fdc6

About this result

Related concepts (32)

Petri net

A Petri net, also known as a place/transition (PT) net, is one of several mathematical modeling languages for the description of distributed systems. It is a class of discrete event dynamic system. A Petri net is a directed bipartite graph that has two types of elements: places and transitions. Place elements are depicted as white circles and transition elements are depicted as rectangles. A place can contain any number of tokens, depicted as black circles. A transition is enabled if all places connected to it as inputs contain at least one token.

Algorithm

In mathematics and computer science, an algorithm (ˈælɡərɪðəm) is a finite sequence of rigorous instructions, typically used to solve a class of specific problems or to perform a computation. Algorithms are used as specifications for performing calculations and data processing. More advanced algorithms can use conditionals to divert the code execution through various routes (referred to as automated decision-making) and deduce valid inferences (referred to as automated reasoning), achieving automation eventually.

Statistics

Statistics (from German: Statistik, () "description of a state, a country") is the discipline that concerns the collection, organization, analysis, interpretation, and presentation of data. In applying statistics to a scientific, industrial, or social problem, it is conventional to begin with a statistical population or a statistical model to be studied. Populations can be diverse groups of people or objects such as "all people living in a country" or "every atom composing a crystal".

Related publications (19)

A Petri Net based approach for modelling multi-layered distributed protocols

Chat with Graph Search

Insights into ontology-based model-based systems engineering: state of the art and enabling framework

Fundamental computational limits of weak learnability in high-dimensional multi-index models

MATHICSE Technical Report : Fast simulations of patient-specific haemodynamics of coronary artery bypass grafts based on a Pod-Galerkin method and a vascular shape parametrization