We develop fibrational perspectives on context-free grammars and on finite state automata
over categories and operads. A generalized CFG is a functor from a free colored operad …

Abstract Neutron-rich nuclei 1 4 7, 1 4 9, 1 5 1 Ce have been studied via the prompt γ-ray
spectroscopy of 248 Cm fission fragments. A partial level scheme for 151 Ce is presented for …

We provide a counterexample to a conjecture by Thiagarajan (1996, 2002) that regular
event structures correspond to event structures obtained as unfoldings of finite 1-safe Petri …

Nielsen et al.[35] proved that every 1-safe Petri net N unfolds into an event structure EN. By
a result of Thiagarajan [46], these unfoldings are exactly the trace-regular event structures …

Verifying that a concurrent program satisfies a given property, such as deadlock-freeness, is
computationally difficult. Naive exploration techniques are facing the state space explosion …

Zielonka's theorem shows that each regular set of Mazurkiewicz traces can be implemented
as a system of synchronized processes provided with some distributed control structure …

Asynchronous automata are a model of communication processes with a distributed control
structure, global initializations and global accepting conditions. The well-known theorem of …

We investigate a general model of concurrency for shared-memory systems. We introduce
some intuitive interleaving semantics within the general framework of automata with …

Asynchronous automata are a model of communication processes with a control structure
distributed on a set P of processes, global initializations and global accepting conditions …

This paper presents algorithms for solving several matching problems on Mazurkiewicz
traces. The creation of the algorithms is reduced to the construction of automata that …