Sciweavers

46 search results - page 1 / 10
» Covering Transitions of Concurrent Systems through Queues
Sort
View
TACAS
2007
Springer
165views Algorithms» more  TACAS 2007»
13 years 11 months ago
Unfolding Concurrent Well-Structured Transition Systems
Abstract. Our main objective is to combine partial-order methods with verification techniques for infinite-state systems in order to obtain efficient verification algorithms fo...
Frédéric Herbreteau, Grégoire...
SOCA
2010
IEEE
13 years 3 months ago
Weighted fair share scheduling for loosely controlled concurrent event systems
In asynchronous event systems, the production of an event is decoupled from its consumption via an event queue. The loose coupling of such systems allows great flexibility as to ...
Sean Rooney, Luis Garcés-Erice, Kristijan D...
LICS
2000
IEEE
13 years 9 months ago
A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names
Concurrent ML is an extension of Standard ML with π-calculus-like primitives for multi-threaded programming. CML has a reduction semantics, but to date there has been no labelled...
Alan Jeffrey, Julian Rathke
WSC
2008
13 years 7 months ago
An object-oriented programming approach for a GIS data-driven simulation model of traffic on an inland waterway
This research proposes the integration of a Geographic Information System (GIS) with the Arena Simulation software to model the transit of ocean-going vessels through the Panama C...
Daniel Sasso, William E. Biles