Vasileios Germanos

Dr. Vasileios Germanos

School of Computer Science and Informatics, De Montfort University, Leicester, UK
orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2021 in ICST Transactions on Security and Safety
Verified
Journal Article
Open access
PDF file
FIFriday Ikuero
Friday Ikuero
VGVasileios Germanos
Vasileios Germanos
LBLaurence Brooks
Laurence Brooks
WZWen Zeng
Wen Zeng

18 July 2024 in Software
Verified
Journal Article
Open access
PDF file
Francois SieweFrancois Siewe
Francois Siewe
VGVasileios Germanos
Vasileios Germanos
WZWen Zeng
Wen Zeng
Petri nets are a graphical notation for describing a class of discrete event dynamic systems whose behaviours are characterised by concurrency, synchronisation, mutual exclusion and conflict. They have been used over the years for the modelling of various distributed systems applications. With the advent of pervasive systems and the Internet of Things, the Calculus of Context-aware Ambients (CCA) has emerged as a suitable formal notation for analysing the behaviours of these systems. In this paper, we are interested in comparing the expressive power of Petri nets to that of CCA. That is, can the class of systems represented by Petri nets be modelled in CCA? To answer this question, an algorithm is proposed that maps any Petri net onto a CCA process. We prove that a Petri net and its corresponding CCA process are behavioural equivalent. It follows that CCA is at least as expressive as Petri nets, i.e., any system that can be specified in Petri nets can also be specified in CCA. Moreover, tools developed for CCA can also be used to analyse the behaviours of Petri nets.

23 April 2024 in Preprints.org
Verified
Preprint
Open access
PDF file
Francois SieweFrancois Siewe
Francois Siewe
VGVasileios Germanos
Vasileios Germanos
WZWen Zeng
Wen Zeng
Petri nets are a graphical notation for describing a class of discrete event dynamic systems whose behaviours are charaterised by concurrency, synchronisation, mutual exclusion and conflict. They have been used over the years for the modelling of various distributed systems applications. With the advent of pervasive systems and the Internet of Things, the Calculus of Context-aware Ambients (CCA) emerged as a suitable formal notation for analysing the behaviours of these systems. In this paper, we are interested in comparing the expressive power of Petri nets to that of CCA. That is, can the class of systems represented by Petri nets be modelled in CCA? To answer this question, an algorithm is proposed that maps any Petri net onto a CCA process. We show that a Petri net and its corresponding CCA process behave the same way through experiments. It follows that CCA is at least as expressive as Petri nets, i.e. any system that can be specified in Petri nets can also be specified in CCA. Moreover, tools developed for CCA can also be used to analyse Petri nets.