Abstract First-order transition systems are a convenient formalism to specify parametric such as multi-agent workflows or distributed algorithms. In general, any nontrivial question about is undecidable. Here, we present three subclasses of first-order where every universal invariant can effectively be decided via fixpoint iteration. These defined in terms syntactical restrictions: negation, st...

Internal positivity offers a computationally cheap certificate for external (input-output) of linear time-invariant system. However, the drawback with this lies in its realization dependency. First, computing such requires finding polyhedral cone potentially high number extremal generators that lifts dimension state-space representation, significantly. Second, not all externally positive system...

Fractional calculus (FC) generalizes the concepts of derivative and integral to non-integer orders [...]

The KBSE community is actively engaged in finding ways to represent software and the activities that relate to various stages in its lifecycle. While the wealth of modeling activities have, necessarily, been founded on first order logic based representations, this paper reports on research into Software Information Systems that has found the domain of software knowledge to be inherently second ...