Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Petri net based verification of distributed algorithms: An example

From MaRDI portal
Publication:1377301
Jump to:navigation, search

DOI10.1007/BF01211299zbMath0889.68071MaRDI QIDQ1377301

Ekkart Kindler, Rolf Walter, Hagen Völzer, Wolfgang Reisig

Publication date: 2 June 1998

Published in: Formal Aspects of Computing (Search for Journal in Brave)


zbMATH Keywords

Petri netsdistributed algorithmsnetwork algorithmecho algorithm


Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed algorithms (68W15)


Related Items (1)

Algebraic nets with flexible arcs


Uses Software

  • UNITY
  • PEP


Cites Work

  • Proving nonreachability by modulo-invariants
  • A principle for sequential reasoning about distributed algorithms
  • Distributed network protocols
  • A Distributed Algorithm for Minimum-Weight Spanning Trees
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Petri net based verification of distributed algorithms: An example

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1377301&oldid=13522525"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 15:12.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki