位置：成果数据库 > 会议 > 会议详情页
Nonwandering points in a SDS
  • 所属机构名称：上海交通大学
  • 会议名称：The 13th IEEE Joint International Computer Science and Information Technology Conference
  • 时间：2011.8.20
  • 成果类型：会议
  • 相关项目：M-可解性、M-计算复杂性与计算机科学的模型理论
作者： Mengqiao Huang|Changshe Ma|
同会议论文项目
M-可解性、M-计算复杂性与计算机科学的模型理论
期刊论文 26 会议论文 51 获奖 5 著作 1
同项目会议论文
An improved full abstraction approach to analyzing locality semantics
Nested Timed Automata
Real-Reward Testing for Probabilistic Processes (Extended Abstract)
The Buffered pi-calulus: A Model for Concurrent Languages
Methodology and Experience for Designing Safety-Related Systems in IEC 61508
Multi-Multiway Cut Problem on Graphs of Bounded Branch Width
<span style="font-family:;" arial",sans-serif;font-size:10.5pt;"=""
<span class="title">The Decidability of the Reachability Problem for CCS!</span&g
The Decidability of the Reachability Problem for CCS!
Approximate Counting via Correlation Decay on Planar Graphs
Listings and Logics
Measuring Time Lag with Nested Preemptions and Resumptions
Query Suggestion by Concept Instantiation
A System for Extracting Top-K Lists from the Web
Consistency and Optimality
Probase: A Probabilistic Taxonomy for Text Understanding
Decidability of Behavioral Equivalences in Process Calculi with Name Scoping
Model Independent Order Relations for Processes
Emerald: An Automated Modeling and Verification Tool for Component‐Based Real‐Time Systems
A fully abstract view for local cause semantics
On the ordered conjecture
A Game Theoretic Model and Tree Analysis Method for Fair Exchange Protocols
Open Bisimulation for Quantum Processes
Checking Equality and Regularity for Normed BPA with Silent Moves
Wikification via link co-occurrence
Watermarking Road Maps against Crop and Merge Attacks
<span style="font-family:;" arial",sans-serif;font-size:10.5pt;"=""
<span style="font-family:&quot;Arial&quot;,sans-serif;font-size:10.5pt;">Clu
<span style="font-family:&quot;Arial&quot;,sans-serif;font-size:10.5pt;">Rho
<span style="font-family:;" arial",sans-serif;font-size:10.5pt;"=""
<span style="background: yellow; font-family:;" arial",sans-serif;font-size:10.5pt
Bounded variable logic, parameterized logarithmic space, and Savitch's theorem
<span style="font-family:;" arial",sans-serif;font-size:10.5pt;"=""
<span style="font-family:;" arial",sans-serif;font-size:10.5pt;"=""
CISC:clustered image search by conceptualization
Toward Topic Search on the Web
Understanding Tables on the Web
Dynamical systems for weak partial metric spaces
The parameterized complexity of k-edge induced subgraphs
Compositional Reasoning for Markov Decision Processes
Well-structured pushdown system: Case of Dense Timed Pushdown Automata
LearnPADS + + : Incremental Inference of Ad Hoc Data Formats
Automatic inference of movements from contact histories
Forest: a language and toolkit for programming with filestores
Fixed-Parameter Tractability of almost CSP Problem with Decisive Relations
Hard instances of algorithms and proof systems
A Framework for Verifying Data-Centric Protocols
<span style="background:yellow;font-family:&quot;Arial&quot;,sans-serif;font-size:10
<span style="font-family:;" arial",sans-serif;font-size:10.5pt;"=""
On the Semantics of Markov Automata