436 search results - page 40 / 88 » Decomposing constraint systems: equivalences and computation... |
128
click to vote
FCT
1999
Springer
15 years 5 months ago
1999
Springer
The aim of this paper is to investigate the relation between two models of concurrent systems: tile rewrite systems and coalgebras. Tiles are rewrite rules with side e ects which a...
JALC
2006
15 years 1 months ago
2006
In this paper we present an extension of Dolev-Yao models for security protocols with a notion of random polynomial-time (Las Vegas) computability. First we notice that Dolev-Yao ...
120
click to vote
VLSID
2003
IEEE
16 years 1 months ago
2003
IEEE
Most verification tools and methodologies such as model checking, equivalence checking, hardware verification, software verification, and hardware-software coverification often fl...
115
click to vote
IJSEKE
2006
15 years 1 months ago
2006
pecific models increase the level of abstraction used to develop large-scale component-based systems. Model-driven development (MDD) approaches (e.g., ModelIntegrated Computing and...
109
click to vote
ISORC
1998
IEEE
15 years 5 months ago
1998
IEEE
The Time-Triggered Architecture (TTA) provides a computing infrastructure for the design and implementation of dependable distributed embedded systems. A large real-time applicatio...