40 search results - page 6 / 8 » Structural translation from Time Petri Nets to Timed Automat... |
CSL
1999
Springer
14 years 2 months ago
1999
Springer
This paper describes a new data structure, difference decision diagrams (DDDs), for representing a Boolean logic over inequalities of the form ¡£¢¥¤§¦©¨ and ¡¢¥¤...
GECCO
2005
Springer
14 years 3 months ago
2005
Springer
Given concentrations of metabolites over a sequence of time steps, the metabolic pathway prediction problem seeks a set of reactions and rate constants for them that could yield t...
CPE
1997
Springer
14 years 2 months ago
1997
Springer
We consider the problem of storing and searching a large state space obtained from a high-level model such as a queueing network or a Petri net. After reviewing the traditional te...
CONCUR
2010
Springer
13 years 11 months ago
2010
Springer
Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditional partial order models like Mazurkiewicz traces, pomsets, event structures, or P...
DCFS
2011
12 years 10 months ago
2011
We prove Kleene theorems for two subclasses of labelled product systems which are inspired from well-studied subclasses of 1bounded Petri nets. For product T-systems we define a c...