Sciweavers

191 search results - page 2 / 39
» Transition systems, link graphs and Petri nets
Sort
View
FAC
2010
148views more  FAC 2010»
13 years 3 months ago
Automating the transformation-based analysis of visual languages
We present a novel approach for the automatic generation of model-to-model transformations given a description of the operational semantics of the source language in the form of gr...
Juan de Lara, Hans Vangheluwe
IFIP
2005
Springer
13 years 10 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é...
ICALP
2010
Springer
13 years 10 months ago
The Downward-Closure of Petri Net Languages
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...
Peter Habermehl, Roland Meyer, Harro Wimmel
JUCS
2007
95views more  JUCS 2007»
13 years 5 months ago
Using Place Invariants and Test Point Placement to Isolate Faults in Discrete Event Systems
: This paper describes a method of using Petri net P-invariants in system diagnosis. To model this process a net oriented fault classification is presented. Hence, the considered d...
Iwan Tabakow
IFIP
1992
Springer
13 years 9 months ago
Controller Implementation by Communicating Asynchronous Sequential Circuits Generated from a Petri Net Specification of Required
This paper presents a completely systematic design procedure for asynchronous controllers. The initial step is the construction of a signal transition graph (STG, an interpreted P...
Jochen Beister, Ralf Wollowski