""" There is a formalism for discrete-event dynamical systems known as “bond graphs”.
""" >From a brief survey of the wikipedia entry: https://en.wikipedia.org/wiki/Bond_graph I see one of the advantages of bond graphs over traditional hypergraphs is the bi-directional nature of the linkages. How similar is the bond graph formalism to the generalization of hypergraphs to operads?
.-- .- -. - / .- -.-. - .. --- -. ..--.. / -.-. --- -. .--- ..- --. .- - . FRIAM Applied Complexity Group listserv Zoom Fridays 9:30a-12p Mtn UTC-6 bit.ly/virtualfriam un/subscribe http://redfish.com/mailman/listinfo/friam_redfish.com FRIAM-COMIC http://friam-comic.blogspot.com/ archives: 5/2017 thru present https://redfish.com/pipermail/friam_redfish.com/ 1/2003 thru 6/2021 http://friam.383.s1.nabble.com/
