• Publications
  • Influence
Opacity Generalised to Transition Systems
TLDR
The notion of opacity is extended to the model of labelled transition systems and generalised in order to better represent concepts from the literature on information flow, and links between opacity and the information flow concepts of anonymity and non-inference are established. Expand
Semantics of Inhibitor Nets
TLDR
An abstract semantics of concurrent systems generalising causal partial orders generalising Mazurkiewicz traces is discussed and stratified order structures can provide an abstract semantics which is consistent with their operational semantics expressed in terms of step sequences. Expand
Petri Net Algebra
This book presents a step-by-step development of a rigorous framework for the specification and verification of concurrent systems. Petri Net Algebra takes its inspiration and methods from ProcessExpand
Modelling Opacity Using Petri Nets
TLDR
A Petri net modelling technique is proposed which allows one to specify different information flow properties, using suitably defined observations of system behaviour, and expressiveness of the resulting framework and the decidability of the associated verification problems are discussed. Expand
Opacity generalised to transition systems
TLDR
The notion of opacity is extended to the model of labelled transition systems and generalised in order to better represent concepts from the literature on information flow, and links between opacity and the information flow concepts of anonymity and non-inference are established. Expand
Canonical prefixes of Petri net unfoldings
TLDR
A general technique for truncating Petri net unfoldings, parameterized according to the level of information about the original unfolding one wants to preserve, is developed and a new notion of completeness of a truncated unfolding is proposed. Expand
Detecting state coding conflicts in STG unfoldings using SAT
TLDR
This work avoids constructing the state graph of an STG, which can lead to state space explosion, and instead uses only the information about causality and structural conflicts between the events involved in a finite and complete prefix of its unfolding, which leads to huge memory savings when compared to methods based on state graphs, but also to significant speedups. Expand
Process semantics of general inhibitor nets
TLDR
It is demonstrated how processes corresponding to step sequences of PTI-nets can be constructed algorithmically, and a non-algorithmic (axiomatic) characterisation is given of all those processes that can be obtained in this way. Expand
Petri Net Semantics of Priority Systems
TLDR
The main goal is to give a formal semantics of ( Σ, ϱ ) by constructing a Petri net Σ ϱ which would retain as much of the concurrency semantics of Σ as possible and at the same time not violate the priority constraints imposed by ϱ. Expand
A Compositional Model of Time Petri Nets
TLDR
Two related algebras are presented which can be used to specify and analyse concurrent systems with explicit timing information and are related through a mapping which, for a t-expression, returns a corresponding ct-box with behaviourally equivalent transition system. Expand
...
1
2
3
4
5
...