Sciweavers

1099 search results - page 179 / 220
» Petri net ontology
Sort
View
IANDC
2002
84views more  IANDC 2002»
13 years 10 months ago
Decidability of Split Equivalence
We show that the following problem is decidable: given expressions E1 and E2 constructed from variables by the regular operations and shuffle, is the identity E1 = E2 true for all...
Y. Abramson, Alexander Moshe Rabinovich
JSI
1998
125views more  JSI 1998»
13 years 10 months ago
The Algebraic Framework for Object-Oriented Systems
Abstract. Category Theory is introduced as the mathematical model for object-oriented systems which are distributed, heterogeneous, real-time, embedded, and open-ended. Each object...
D. H. H. Yoon
TCAD
1998
82views more  TCAD 1998»
13 years 10 months ago
Structural methods for the synthesis of speed-independent circuits
Most existing tools for the synthesisof asynchronouscircuits from Signal Transition Graphs (STGs) derive the reachability graph for the calculation of logic equations. This paper ...
Enric Pastor, Jordi Cortadella, Alex Kondratyev, O...
PKDD
2010
Springer
193views Data Mining» more  PKDD 2010»
13 years 9 months ago
Process Mining Meets Abstract Interpretation
Mining Meets Abstract Interpretation J. Carmona and J. Cortadella Universitat Polit`ecnica de Catalunya, Spain The discovery of process models out of system traces is a problem tha...
Josep Carmona, Jordi Cortadella
RP
2010
Springer
150views Control Systems» more  RP 2010»
13 years 8 months ago
Rewriting Systems for Reachability in Vector Addition Systems with Pairs
We adapt hypergraph rewriting system to a generalization of Vector Addition Systems with States (VASS) that we call vector addition systems with pairs (VASP). We give rewriting sys...
Paulin Jacobé de Naurois, Virgile Mogbil