Petri net unfolding prefixes are an important technique for formal verification and synthesis of concurrent systems. In this paper we show that the requirement that the adequate order used for truncating a Petri net unfolding must be well-founded is superfluous in many important cases, i.e., it logically follows from other requirements. We give a complete analysis when this is the case. These r...

OBJECTIVE To provide a baseline description of psychosocial workplace stressors and supports along with safety, injury, health, and well-being indicators in a sample of utility and construction workers for a National Institute for Occupational Safety and Health-funded Total Worker Health™ intervention study. METHODS Survey responses and health assessments were collected from a total of 349 em...

This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq module functors for constructing complex lattices using efficient data structures. The lattice signature contains a well-foundedness proof obligation which ensures termination of generic fixpoint iteration algorithms. Wi...

We revisit Khudaverdian’s geometric construction of an odd nilpotent operator ∆E that sends semidensities to semidensities on an antisymplectic manifold. We find a local formula for the ∆E operator in arbitrary coordinates and we discuss its connection to Batalin-Vilkovisky quantization. MCS number(s): 53A55; 58A50; 58C50; 81T70.

In the final chain of the countable powerset functor, we show that the set at index ω1, regarded as a transition system, is not strongly extensional because it contains a “ghost” element that has no successor even though its component at index 1 is nonempty. For Jirka Adámek on his 70th birthday, with thanks for his many contributions and his inspiration.

Diversity-oriented synthesis (DOS) is an important field involving the synthesis of libraries of diverse small molecules for applications including biological screening. The last decade has witnessed major progress in the field, with continued emphasis on structural and functional diversity for DOS library construction. A number of recent reviews have updated the community on this topic, includ...

In recent years, there has been increased attention on the possible impact of future robotics and AI systems. Prominent thinkers have publicly warned about the risk of a dystopian future when the complexity of these systems progresses further. These warnings stand in contrast to the current state-of-the-art of the robotics and AI technology. This article reviews work considering both the future...

In 1952, Thompson deened four transformations on extensive games, and proved that they leave the reduced normal form intact (a so{ called \adequacy" theorem). Kohlberg&Mertens, in 1986, proposed two additional game transformations. In this paper, I will state and prove adequacy results for all six transformations in a uniform manner. Then, a number of well{known solution concepts will be survey...

Compositional distributional semantic models (CDSMs) have successfully been applied to the task of predicting the meaning of a range of linguistic constructions. Their performance on semicompositional word formation process of (morphological) derivation, however, has been extremely variable, with no large-scale empirical investigation to date. This paper fills that gap, performing an analysis o...

Björner [1] showed how a construction by von Neumann of examples of continuous geometries can be adapted to construct a continuous analogue of finite partition lattices. Björner's construction realizes the continuous partition lattice abstractly, as a completion of a direct limit of finite lattices. Here we give an alternative construction realizing a continuous partition lattice concretely as ...