Persistent and nonviolent steps and the design of GALS systems

J Fernandes, M Koutny, Ł Mikulski… - Fundamenta …, 2015 - content.iospress.com
A concurrent system is persistent if throughout its operation no activity which became
enabled can subsequently be prevented from being executed by any other activity. This is …

[PDF][PDF] On Decidability of Persistence Notions.

K Barylska, L Mikulski - CS&P, 2015 - ceur-ws.org
Persistence is a widely investigated fundamental property of concurrent systems, which was
extended in many ways. We propose a unified characterisation of several notions …

Step persistence in the design of GALS systems

J Fernandes, M Koutny, M Pietkiewicz-Koutny… - Application and Theory …, 2013 - Springer
In this paper we investigate the behaviour of GALS (Globally Asynchronous Locally
Synchronous) systems in the context of VLSI circuits. The specification of a system is given …

Hierarchy of persistence with respect to the length of action's disability

K Barylska, E Ochmański - arXiv preprint arXiv:1512.01952, 2015 - arxiv.org
The notion of persistence, based on the rule" no action can disable another one" is one of
the classical notions in concurrency theory. It is also one of the issues discussed in the Petri …

[PDF][PDF] Persistency and Nonviolence Decision Problems in P/T-Nets with Step Semantics.

K Barylska - PNSE@ Petri Nets, 2014 - ceur-ws.org
Persistency is one of the notions widely investigated due to its application in concurrent
systems. The classical notion refers to nets with a standard sequential semantics. We will …

[HTML][HTML] An extension of the taxonomy of persistent and nonviolent steps

M Koutny, Ł Mikulski, M Pietkiewicz-Koutny - Information Sciences, 2017 - Elsevier
The design and analysis of concurrent computing systems is often concerned with
fundamental behavioural properties involving system activities, eg, boundedness, liveness …