Flexibility in Algebraic Nets
From MaRDI portal
Publication:6487399
DOI10.1007/3-540-69108-1_19zbMATH Open1523.68043MaRDI QIDQ6487399FDOQ6487399
Authors: Ekkart Kindler, H. Völzer
Publication date: 9 December 2022
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Distributed algorithms (68W15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Computer science today. Recent trends and developments
- The non-sequential behaviour of Petri nets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Petri nets and algebraic specifications
- Proving nonreachability by modulo-invariants
- Title not available (Why is that?)
- Verification of siphons and traps for algebraic Petri nets
- Title not available (Why is that?)
- Petri net based verification of distributed algorithms: An example
- Title not available (Why is that?)
- Title not available (Why is that?)
- Flexibility in Algebraic Nets
Cited In (4)
This page was built for publication: Flexibility in Algebraic Nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487399)