Transition systems, link graphs and Petri nets

From MaRDI portal

Revision as of 18:21, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3419786

Jump to:navigation, search

DOI10.1017/S0960129506005664zbMath1107.68056OpenAlexW2089663991MaRDI QIDQ3419786

James J. Leifer, Arthur J. 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

Mathematics Subject Classification ID

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

Related Items (10)

DBtk: A Toolkit for Directed Bigraphs ⋮ Reactive systems, (semi-)saturated semantics and coalgebras on presheaves ⋮ An inductive characterization of matching in binding bigraphs ⋮ Pure bigraphs: structure and dynamics ⋮ Unnamed Item ⋮ Kind Bigraphs ⋮ Local Bigraphs and Confluence: Two Conjectures ⋮ Directed Bigraphs ⋮ Matching of Bigraphs ⋮ Bigraphs and Their Algebra

Uses Software

SLMC

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3419786&oldid=16715901"