Sciweavers

227 search results - page 37 / 46
» P Systems and Finite Automata
Sort
View
LOPSTR
1994
Springer
14 years 1 months ago
A Transformation System for Definite Programs Based on Termination Analysis
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
J. Cook, John P. Gallagher
TCAD
2008
103views more  TCAD 2008»
13 years 9 months ago
Topology-Based Performance Analysis and Optimization of Latency-Insensitive Systems
Latency-insensitive protocols allow system-on-chip (SoC) engineers to decouple the design of the computing cores from the design of the intercore communication channels while follo...
Rebecca L. Collins, Luca P. Carloni
FUIN
2008
72views more  FUIN 2008»
13 years 10 months ago
Working with the Past: Integrating History in Petri Nets
Abstract. Most information systems that are driven by process models (e.g., workflow management systems) record events in event logs, also known as transaction logs or audit trails...
Kees M. van Hee, Alexander Serebrenik, Natalia Sid...
JSC
2006
102views more  JSC 2006»
13 years 9 months ago
Counting and locating the solutions of polynomial systems of maximum likelihood equations, I
In statistics, mixture models consisting of several component subpopulations are used widely to model data drawn from heterogeneous sources. In this paper, we consider maximum lik...
Max-Louis G. Buot, Donald St. P. Richards
FUIN
2010
141views more  FUIN 2010»
13 years 7 months ago
Decidability Problems in Petri Nets with Names and Replication
In this paper we study decidability of several extensions of P/T nets with name creation and/or replication. In particular, we study how to restrict the models of RN systems (P/T n...
Fernando Rosa Velardo, David de Frutos-Escrig