Sciweavers

20 search results - page 1 / 4
» Back-Forth Equivalences for Design of Concurrent Systems
Sort
View
LFCS
1997
Springer
13 years 8 months ago
Back-Forth Equivalences for Design of Concurrent Systems
The paper is devoted to the investigation of behavioural equivalences of concurrent systems modelled by Petri nets. Back-forth bisimulation equivalences known from the literature a...
Igor V. Tarasyuk
MOMPES
2008
IEEE
13 years 11 months ago
Architectural Concurrency Equivalence with Chaotic Models
During its lifetime, embedded systems go through multiple changes to their runtime architecture. That is, threads, processes, and processor are added or removed to/from the softwa...
Dionisio de Niz
CONCUR
2006
Springer
13 years 8 months ago
Modeling Timed Concurrent Systems
Timed concurrent systems are widely used in concurrent and distributed real-time software, modeling of hybrid systems, design of hardware systems (using hardware description langua...
Xiaojun Liu, Eleftherios Matsikoudis, Edward A. Le...
CONCUR
1999
Springer
13 years 8 months ago
Statecharts Via Process Algebra
Statecharts is a visual language for specifying the behavior of reactive systems. The language extends nite-state machines with concepts of hierarchy, concurrency, and priority. De...
Gerald Lüttgen, Michael von der Beeck, Rance ...
ICC
2007
IEEE
116views Communications» more  ICC 2007»
13 years 11 months ago
Skip Tree Graph: a Distributed and Balanced Search Tree for Peer-to-Peer Networks
Abstract—Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It...
Alejandra González Beltrán, Paul Sag...