[Code from Joseph]
[Code from Joseph]
In[]:=
TFAMultiwayGraph[graph_,i_,t_,opts___]:=Module[{s,n,l},With[{rules=Map[s[l_List,n_]/;Part[l,#1]>0:>s[l+#2,n+1]&[First[#],Last[#]]&,Thread[{EdgeList[graph][[All,1]],Map[UnitVector[VertexCount[graph],Last[#]]-UnitVector[VertexCount[graph],First[#]]&,EdgeList[graph]]}]]},With[{g=NestGraph[ReplaceList[#,rules]&,s[#,0]&/@Union[Apply[Plus,Tuples[Map[UnitVector[VertexCount[graph],#]&,VertexList[graph]],i],1]],t]},Graph[g,opts,VertexLabels->(#->Row[First[#]]&/@VertexList[g]),GraphLayout"LayeredDigraphEmbedding"]]]]
In[]:=
Graph
,VertexLabels->Automatic
Out[]=
In[]:=
TFAMultiwayGraph
,1,3
Out[]=
In[]:=
TFAMultiwayGraph
,2,3
Out[]=
In[]:=
Graph[{1->2,2->1}]
Out[]=
In[]:=
TFAMultiwayGraph
,1,3
Out[]=
In[]:=
TFAMultiwayGraph
,2,5
Out[]=
In[]:=
TFAMultiwayGraph
,3,5
Out[]=
[These aren’t connected because they reach a given complete state on different phases of time...]
In[]:=
TFAMultiwayGraph
,4,8
Out[]=
Deduplication
Deduplication
To-do
To-do
Make deduplicated case
Make deduplicated case
Visualization of a particular marker path
Visualization of a particular marker path
Compare finite MWs with underlying NDFA graphs....
Compare finite MWs with underlying NDFA graphs....
PNML
PNML