期刊


ISSN0304-3975
刊名Theoretical Computer Science
参考译名理论计算机科学
收藏年代2002~2024



全部

2002 2003 2004 2005 2006 2007
2008 2009 2010 2011 2012 2013
2014 2015 2016 2017 2018 2019
2020 2021 2022 2023 2024

2006, vol.350, no.1 2006, vol.350, no.2-3 2006, vol.351, no.1 2006, vol.351, no.2 2006, vol.351, no.3 2006, vol.352, no.1-3
2006, vol.353, no.1-3 2006, vol.354, no.1 2006, vol.354, no.2 2006, vol.354, no.3 2006, vol.355, no.1 2006, vol.355, no.2
2006, vol.355, no.3 2006, vol.356, no.1-2 2006, vol.356, no.3 2006, vol.357, no.1-3 2006, vol.358, no.1 2006, vol.358, no.2-3
2006, vol.359, no.1-3 2006, vol.360, no.1-3 2006, vol.361, no.1 2006, vol.361, no.2-3 2006, vol.362, no.1-3 2006, vol.363, no.1
2006, vol.363, no.2 2006, vol.363, no.3 2006, vol.364, no.1 2006, vol.364, no.2 2006, vol.364, no.3 2006, vol.365, no.1-2
2006, vol.365, no.3 2006, vol.366, no.1-2 2006, vol.366, no.3 2006, vol.367, no.1-2 2006, vol.367, no.3 2006, vol.368, no.1-2
2006, vol.368, no.3 2006, vol.369, no.1-3

题名作者出版年年卷期
Message-passing automata are expressively equivalent to EMSO logicBenedikt Bollig; Martin Leucker20062006, vol.358, no.2-3
Probabilistic event structures and domainsDaniele Varacca; Hagen Volzer; Glynn Winskel20062006, vol.358, no.2-3
Asynchronous games 2: The true concurrency of innocencePaul-Andre Mellies20062006, vol.358, no.2-3
Resource control for synchronous cooperative threadsRoberto M. Amadio; Silvano Dal Zilio20062006, vol.358, no.2-3
Characterizing EF and EX tree logicsMikolaj Bojanczyk; Igor Walukiewicz20062006, vol.358, no.2-3
Model checking restricted sets of timed pathsNicolas Markey; Jean-Francois Raskin20062006, vol.358, no.2-3
Elimination of quantifiers and undecidability in spatial logics for concurrencyLuis Caires; Etienne Lozes20062006, vol.358, no.2-3
A general approach to comparing infinite-state systems with their finite-state specificationsAntonin Kucera; Philippe Schnoebelen20062006, vol.358, no.2-3