656 search results - page 85 / 132 » A Formalization of Transition P Systems |
ASE
2004
15 years 9 days ago
2004
The verification of concurrent systems through an exhaustive traversal of the state space suffers from the infamous state-space-explosion problem, caused by the many interleavings ...
108
Voted
STOC
1993
ACM
15 years 4 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
121
Voted
LOGCOM
1998
15 years 3 days ago
1998
Sound and complete modal propositional logic C is presented, in which 2P has the interpretation “ P is true in all states”. The interpretation is already known as the Carnapia...
85
Voted
ICCS
2004
Springer
15 years 5 months ago
2004
Springer
Mathematical modeling of growing multicellular structures creates the problem of solving systems of equations in which not only the values of variables, but the equations themselv...
95
Voted
CAV
2009
Springer
16 years 1 months ago
2009
Springer
ity Abstraction for Declarative Networking Applications Juan A. Navarro P?erez, Andrey Rybalchenko, and Atul Singh Max Planck Institute for Software Systems (MPI-SWS) Declarative N...