3 papers
cs.PL2023
Communicating Actor Automata -- Modelling Erlang Processes as Communicating Machines
Dominic Orchard, Mihail Munteanu, Paulo Torrens
Brand and Zafiropulo's notion of Communicating Finite-State Machines (CFSMs) provides a succinct and powerful model of message-passing concurrency, based around channels. However,…
math.SG2019
Essential tori in spaces of symplectic embeddings
Julian Chaidez, Mihai Munteanu
Given two --dimensional symplectic ellipsoids whose symplectic sizes satisfy certain inequalities, we show that a certain map from the --torus to the space of symplectic emb…
math.SG2018
Noncontractible loops of symplectic embeddings between convex toric domains
Mihai Munteanu
Given two 4-dimensional ellipsoids whose symplectic sizes satisfy a specified inequality, we prove that a certain loop of symplectic embeddings between the two ellipsoids is noncon…