Sciweavers

436 search results - page 40 / 88
» Decomposing constraint systems: equivalences and computation...
Sort
View
FCT
1999
Springer
14 years 28 days ago
Tile Transition Systems as Structured Coalgebras
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...
Andrea Corradini, Reiko Heckel, Ugo Montanari
JALC
2006
61views more  JALC 2006»
13 years 8 months ago
Random Polynomial-Time Attacks and Dolev-Yao Models
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 ...
Mathieu Baudet
VLSID
2003
IEEE
180views VLSI» more  VLSID 2003»
14 years 9 months ago
Automating Formal Modular Verification of Asynchronous Real-Time Embedded Systems
Most verification tools and methodologies such as model checking, equivalence checking, hardware verification, software verification, and hardware-software coverification often fl...
Pao-Ann Hsiung, Shu-Yu Cheng
IJSEKE
2006
99views more  IJSEKE 2006»
13 years 8 months ago
Weaving Deployment Aspects into Domain-specific Models
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...
Krishnakumar Balasubramanian, Aniruddha S. Gokhale...
ISORC
1998
IEEE
14 years 27 days ago
The Time-Triggered Architecture
The Time-Triggered Architecture (TTA) provides a computing infrastructure for the design and implementation of dependable distributed embedded systems. A large real-time applicatio...
Hermann Kopetz