Sciweavers

1168 search results - page 190 / 234
» cases 2000
Sort
View
ENTCS
2000
97views more  ENTCS 2000»
14 years 9 months ago
Complexity of Weak Bisimilarity and Regularity for BPA and BPP
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Basic Parallel Processes (BPP). A PSPACE lower bound for BPA and NP lower bound fo...
Jirí Srba
FAC
2000
114views more  FAC 2000»
14 years 9 months ago
Representational Reasoning and Verification
Formal approaches to the design of interactive systems rely on reasoning about properties of the t a very high level of abstraction. Specifications to support such an approach typi...
Gavin J. Doherty, José Creissac Campos, Mic...
FAC
2000
94views more  FAC 2000»
14 years 9 months ago
Maximally Concurrent Programs
Typically, program design involves constructing a program P that implements a given specification S; that is, the set P of executions of P is a subset of the set S of executions s...
Rajeev Joshi, Jayadev Misra
82
Voted
FUIN
2000
68views more  FUIN 2000»
14 years 9 months ago
Models For Dependable Computation with Multiple Inputs and Some Hardness Results
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
Yongge Wang, Yvo Desmedt, Mike Burmester
48
Voted
GEOINFORMATICA
2000
73views more  GEOINFORMATICA 2000»
14 years 9 months ago
GIS and Transportation: Status and Challenges
The evolution of GIS-T is characterized in three stages: the map view, the navigational view, and the behavioral view. The static nature of the map view favors applications relate...
Michael F. Goodchild