Sciweavers

1369 search results - page 70 / 274
» On the Semantics of Petri Nets
Sort
View
JCSS
2010
68views more  JCSS 2010»
14 years 11 months ago
Simplified proof of the blocking theorem for free-choice Petri nets
: Every cluster in a bounded and live free-choice system has a unique blocking marking. It can be reached by firing an occurrence sequence, which avoids any transition of the clust...
Joachim Wehler
APN
2005
Springer
15 years 6 months ago
Continuization of Timed Petri Nets: From Performance Evaluation to Observation and Control
State explosion is a fundamental problem in the analysis and synthesis of discrete event systems. Continuous Petri nets can be seen as a relaxation of discrete models allowing more...
Manuel Silva, Laura Recalde
LREC
2010
182views Education» more  LREC 2010»
15 years 2 months ago
Aligning FrameNet and WordNet based on Semantic Neighborhoods
This paper presents an algorithm for aligning FrameNet lexical units to WordNet synsets. Both, FrameNet and WordNet, are well-known as well as widely-used resources by the entire ...
Óscar Ferrández, Michael Ellsworth, ...
RECOMB
2005
Springer
16 years 1 months ago
The Pathalyzer: A Tool for Analysis of Signal Transduction Pathways
Abstract. The Pathalyzer is a program for analyzing large-scale signal transduction networks. Reactions and their substrates and products are represented as transitions and places ...
David L. Dill, Merrill Knapp, Pamela Gage, Carolyn...
IFIP
2005
Springer
15 years 6 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é...