Asynchronous circuits behave like concurrent programs implemented in hardware logic.
The processes in such circuits are synchronised in accordance with the dynamic logical and …

We investigate the synthesis problem for the Elementary Net Systems with Inhibitor Arcs (ENI-systems)
executed according to the a-priori semantics. We characterise transition systems …

We here consider transition systems of Elementary Net Systems with inhibitor arcs. There
are basically two different types of non-interleaving semantics of such Petri nets, the a-…

The unconstrained step semantics of Petri nets is impractical for simulating and modelling
applications. In the past, this inadequacy has been alleviated by introducing various flavours …

Automated synthesis from behavioural specifications is an attractive way of constructing
computational systems. In this paper, we look at a specific instance of this approach which aims …

In this paper, we investigate transition systems of a class of Petri nets suitable for the modelling
and behavioural analysis of globally asynchronous locally synchronous systems. The …

We investigate the synthesis problem for ENCL-systems, defined as Elementary Net Systems
extended with context (inhibitor and activator) arcs and explicit event localities. Since …

Boolean nets are a family of Petri net models with very simple markings which are sets of
places. We investigate several classes of boolean nets distinguished by different kinds of …

Elementary net systems with localities (enl-systems) is a class of Petri nets introduced to
model globally asynchronous locally synchronous systems (gals), where some of the …

Automated synthesis from behavioural specifications, such as transition systems, is an
attractive way of constructing correct concurrent systems. In this paper, we investigate the …