Sciweavers

13 search results - page 3 / 3
» Concurrent Automata vs. Asynchronous Systems
Sort
View
LPNMR
2001
Springer
13 years 8 months ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä
ISTCS
1992
Springer
13 years 7 months ago
Concurrent Timestamping Made Simple
Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memorysystem, a powerful tool for concurrency control, serving...
Rainer Gawlick, Nancy A. Lynch, Nir Shavit
ICLP
2005
Springer
13 years 9 months ago
Modeling Systems in CLP
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...
Joxan Jaffar, Andrew E. Santosa, Razvan Voicu