11 search results - page 1 / 3 » Petri Nets, Flat Languages and Linear Arithmetic |
65
Voted
WFLP
2000
Springer
15 years 1 months ago
2000
Springer
AC
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. As semiconductor technology strides towards billions of transistors on a single die, problems concerned with deep sub-micron process features and design productivity call...
LATA
2010
Springer
14 years 8 months ago
2010
Springer
We apply language theory to compare the expressive power of models that extend Petri nets with features like colored tokens and/or whole place operations. Specifically, we conside...
CAAP
1990
15 years 1 months ago
1990
The chief purpose of this paper is to appraise the feasibility of Girard’s linear logic as a specification language for parallel processes. To this end we propose an interpreta...
103
click to vote
ACSD
2008
IEEE
14 years 11 months ago
2008
IEEE
In this paper we present an algorithm to synthesize a finite unlabeled place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by a term ove...