190 search results - page 12 / 38 » P Systems, Petri Nets, and Program Machines |
SAC
2008
ACM
13 years 7 months ago
2008
ACM
Model-Driven Engineering (MDE) has been advocated as an effective way to deal with today's software complexity. MDE can be seen as an integrative approach combining existing ...
AICT
2005
IEEE
14 years 1 months ago
2005
IEEE
Programming on the Web enlights some classical problems encountered on large distributed applications with a particular emphasis on dynamic changes. In that context, we are intere...
ICCAD
2006
IEEE
14 years 4 months ago
2006
IEEE
Early evaluation allows to execute operations when enough information at the inputs has been received to determine the value at the outputs. Systems that can tolerate variable-lat...
ATVA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
FUIN
2007
13 years 7 months ago
2007
We define Concurrent Turing Machines (CTMs) as Turing machines with Petri nets as finite control. This leads to machines with arbitrary many tape heads, thus subsuming any class ...