744 search results - page 110 / 149 » Observations on the Decidability of Transitions |
FASE
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Software models are key in separating and solving independent development concerns. However, there is still a gap on how to transition design information among these sepa...
STOC
1993
ACM
14 years 1 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...
ELPUB
2007
ACM
14 years 1 months ago
2007
ACM
Two international scientific publishers collaborated to develop an Online Submission and Peer Review System (OSPREY) for their journals. Our goals were to meet market demand, incr...
APN
2008
Springer
13 years 11 months ago
2008
Springer
In this paper, we address the class of bounded Petri nets with stopwatches (SwPNs), which is an extension of T-time Petri nets (TPNs) where time is associated with transitions. Con...
BIRTHDAY
2010
Springer
13 years 10 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...