191 search results - page 4 / 39 » Transition systems, link graphs and Petri nets |
ACTA
2007
13 years 8 months ago
2007
Abstract This paper introduces the notion of well-structured language. A wellstructured language can be defined by a labelled well-structured transition system, equipped with an u...
BPM
2006
Springer
13 years 10 months ago
2006
Springer
The theory of regions and the algorithms for synthesizing a Petri net model from a transition system, which are based on this theory, have interesting practical applications
ACSD
1998
IEEE
14 years 7 days ago
1998
IEEE
State coding conflict detection is a fundamental part of synthesis of asynchronous concurrent systems from their specifications as Signal Transition Graphs (STGs), which are a spe...
APN
2008
Springer
13 years 10 months ago
2008
Springer
This paper presents an algorithm for the synthesis of bounded Petri nets from transition systems. A bounded Petri net is always provided in case it exists. Otherwise, the events ar...
ECEASST
2008
13 years 8 months ago
2008
: This paper introduces negative application conditions for reconfigurable place/transition nets. These are Petri nets together with a set of rules that allow changing the net and ...