Sciweavers

7099 search results - page 336 / 1420
» Context for models of concurrency
Sort
View
ACSD
2008
IEEE
114views Hardware» more  ACSD 2008»
16 years 2 months ago
Modeling and verifying asynchronous communication mechanisms using coloured Petri nets
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In previous work, two automati...
Kyller Costa Gorgônio, Fei Xia
LCPC
2001
Springer
15 years 12 months ago
An Interface Model for Parallel Components
Component architectures promote cross-project code reuse by facilitating composition of large applications using off-the-shelf software components. Existing component architecture...
Milind A. Bhandarkar, Laxmikant V. Kalé
KR
1994
Springer
15 years 11 months ago
Modalities Over Actions, I. Model Theory
This paper analyzes a language for actions and the deontic modalities over actions -- i.e., the modalities permitted, forbidden and obligatory. The work is based on: (1) an action...
L. Thorne McCarty
CONCUR
2000
Springer
15 years 11 months ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko
SPIN
2000
Springer
15 years 11 months ago
Model-Checking Multi-threaded Distributed Java Programs
Systematic state-space exploration is a powerful technique for veri cation of concurrent software systems. Most work in this area deals with manually-constructed models of those sy...
Scott D. Stoller