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

A distributed algorithm for GSPN reachability graph generation

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

DOI10.1006/jpdc.2000.1664zbMath0973.68260OpenAlexW2020727467MaRDI QIDQ5929020

No author found.

Publication date: 27 November 2001

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.2000.1664


zbMATH Keywords

generalized stochastic Petri nets


Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)


Related Items (2)

Reachability analysis based on structured representations ⋮ Unnamed Item


Uses Software

  • GreatSPN
  • GreatSPN 1.7



This page was built for publication: A distributed algorithm for GSPN reachability graph generation

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