Transition systems, link graphs and Petri nets

DOI10.1017/S0960129506005664zbMATH Open1107.68056OpenAlexW2089663991MaRDI QIDQ3419786FDOQ3419786

Authors: James J. Leifer, Robin Milner 

Publication date: 7 February 2007

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129506005664

Recommendations

• Petri nets and bisimulation
• A categorical linear framework for Petri nets
• Lectures on Concurrency and Petri Nets
• PETRI NETS AND STEP TRANSITION SYSTEMS
• A congruence for Petri nets

Mathematics Subject Classification ID

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

Cited In (18)

• Title not available (Why is that?)
• \textsf{DBtk}: a toolkit for directed bigraphs
• Directed bigraphs
• Title not available (Why is that?)
• Formal Methods in Software and Systems Modeling
• Title not available (Why is that?)
• Lectures on Concurrency and Petri Nets
• Title not available (Why is that?)
• Kind Bigraphs
• Local bigraphs and confluence: two conjectures (extended abstract)
• Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
• Pure bigraphs: structure and dynamics
• An inductive characterization of matching in binding bigraphs
• Bigraphs and their algebra
• Analysis and application of transition systems based on Petri nets and relation matrices to business process management
• PETRI NETS AND STEP TRANSITION SYSTEMS
• Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
• Matching of bigraphs

Uses Software

• SLMC

This page was built for publication: Transition systems, link graphs and Petri nets

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