In this paper, we address challenges of organizing future-oriented consultation processes within European coordination tools for ‘Open Method of Coordination’ – such as ERA-NETs – which are promoted by the European Commission towards the establishment of the European ResearchArea. Specifically, we report experiences from a recent consultation process that was organized withinWoodWisdom-Net (ERA...

In recent years much attention has been paid to parallelism and concurrent systems. Petri nets are a formalism which is commonly used for these studies [8]. The theory of Petri nets can be described in the mathematical frame of vector addition systems (VAS). Although these two approaches are equivalent, we formulate our results here in the VAS formalism. Karp and Miller provided in [5] a tool w...

Petri nets are a well-known and intensively studied model of concurrency often used to specify distributed or parallel systems. Vector addition systems with states are simply Petri nets provided control states. In this paper we introduce a natural partial order semantics for vector addition systems with states which extends the process semantics of Petri nets. The addition of control states to ...

Background: The annual statistics of Drug and Poison Information Centers (DPICs) have critical role in public health planning. The objective of this study was to provide annual epidemiologic profile of drug inquiry and poisoning-related phone calls to Iran’s DPICs during 2014-2015. Methods: This was a descriptive retrospective study by reviewing reported phone calls of Iranian DPICs to central...

In this paper we study supervisory control of discrete event systems using state variables for representation and speci cation. The motivation is two fold: rstly, a state variable representation allows a concise characterization of systems with in nitely many states, and secondly, state variable speci cation allows characterization of qualitative properties of general nondeterministic systems. ...

Backdoors are a powerful tool to obtain efficient algorithms for hard problems. Recently, two new notions of backdoors to planning were introduced. However, for one of the new notions (i.e., variable-deletion) only hardness results are known so far. In this work we improve the situation by defining a new type of variabledeletion backdoors based on the extended causal graph of a planning instanc...