Sciweavers

97 search results - page 8 / 20
» Petri Nets with Simple Circuits
Sort
View
IFIP
2005
Springer
14 years 1 months ago
Opacity Generalised to Transition Systems
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...
Jeremy Bryans, Maciej Koutny, Laurent Mazaré...
SIMPRA
2008
137views more  SIMPRA 2008»
13 years 7 months ago
An admissible-behaviour-based analysis of the deadlock in Petri-net controllers
This paper addresses the problem of verifying the discrete control logic that is typically implemented by programmable controllers. Not only are the logical properties of the cont...
G. Music, Drago Matko
APN
2005
Springer
14 years 1 months ago
Determinate STG Decomposition of Marked Graphs
STGs give a formalism for the description of asynchronous circuits based on Petri nets. To overcome the state explosion problem one may encounter during circuit synthesis, a nondet...
Mark Schäfer, Walter Vogler, Petr Jancar
ECEASST
2006
103views more  ECEASST 2006»
13 years 7 months ago
Petri Nets and Matrix Graph Grammars: Reachability
This paper contributes in two directions. First, several concepts of our matrix approach to graph transformation [1,2] such as coherence and minimal initial digraph are applied to ...
Juan de Lara, Pedro Pablo Pérez Velasco
AUTOMATICA
2010
106views more  AUTOMATICA 2010»
13 years 5 months ago
Fault detection for discrete event systems using Petri nets with unobservable transitions
In this paper we present an efficient approach for the fault detection of discrete event systems using Petri nets. We assume that some of the transitions of the net are unobservabl...
Maria Paola Cabasino, Alessandro Giua, Carla Seatz...