Learn More
Recently, opacity has proved to be a promising technique for describing security properties. Much of the work has been couched in terms of Petri nets. Here, we extend the notion of opacity to the model of labelled transition systems and generalise opacity in order to better represent concepts from the work on information flow. In particular, we establish(More)
We consider opacity as a property of the local states of the secure (or high-level) part of the system, based on the observation of the local states of a low-level part of the system as well as actions. We propose a Petri net modelling technique which allows one to specify different information flow properties, using suitably defined observations of system(More)
We consider the modelling of the behaviour of membrane systems using Petri nets. First, a systematic, structural, link is established between a basic class of membrane systems and Petri nets. To capture the compartmentisation of membrane systems, localities are proposed as an extension of Petri nets. This leads to a locally maximal concurrency semantics for(More)
This paper presents the operational semantics and the Petri net semantics of a fragment of the box algebra in tutorial style. For the operational semantics, induc-tive rules for marked expressions are given. For the net semantics, a general mechanism of refinement and relabelling is introduced, using which the connectives of the algebra are defined. A(More)
The paper presents a new method for checking Uniqueand Complete State Coding, the crucial conditions in thesynthesis of asynchronous control circuits from Signal TransitionGraphs (STGs). The method detects state coding conflictsin an STG using its partial order semantics (unfoldingprefix) and an integer programming technique. This leads tohuge memory(More)