A Petri Net Based Modeling of Active Objects and Futures

Abstract

Abstract. We give two different notions of deadlock for systems based on active objects and futures. One is based on blocked objects and conforms with the classical definition of deadlock by Coffman, Jr. et al. The other one is an extended notion of deadlock based on blocked processes which is more general than the classical one. We introduce a technique to prove deadlock freedom of systems of active objects. To check deadlock freedom an abstract version of the program is translated into Petri nets. Extended deadlocks, and then also classical deadlock, can be detected via checking reachability of a distinct marking. Absence of deadlocks in the Petri net constitutes deadlock freedom of the concrete system.

Probabilistic software product lines

“…Also it is interesting the future integration's of our formal framework to existing tooling frameworks like ProFeat [39] and probabilistic model checkers like PRISM [40]. Finally, a significant line of research could be the integration of research on SPL with work deadlock avoidance/analysis [43][44][45][46][47][48], so to scale the analysis from single systems to entire software families.…”

A Formal Approach to Microservice Architecture Deployment

“…Neither proposals support the computation of optimal deployments. Notice that our work focuses on architectural aspects of (deployed) microservices and not on their low-level invocation flow, which regards issues of service behavioural compliance (see, e.g., [4,12,13,18] where process algebra [7] related techniques are adopted) or deadlock/termination analysis (see, e.g., [9,19]) that are not a concern of this paper.…”

Asynchronous session subtyping as communicating automata refinement

“…The overall correctness of the system is guaranteed when the session types of the interacting endpoints satisfy some deadlock/termination related (see, e.g. [16,23]) compatibility notion. For instance, in case of binary communication, i.e.…”