Sciweavers

68 search results - page 3 / 14
» A Concurrent and Compositional Petri Net Semantics of Preemp...
Sort
View
APN
2007
Springer
15 years 3 months ago
A Compositional Method for the Synthesis of Asynchronous Communication Mechanisms
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In previous work, an automatic ...
Kyller Costa Gorgônio, Jordi Cortadella, Fei...
ECBS
2009
IEEE
130views Hardware» more  ECBS 2009»
15 years 4 months ago
Validating and Dynamically Adapting and Composing Features in Concurrent Product-Lines Applications
With the pressing in-time-market towards customized services, software product lines (SPL) are increasingly characterizing most of software landscape. SPL are mainly structured th...
Nasreddine Aoumeur, Kamel Barkaoui, Gunter Saake
TACAS
2010
Springer
156views Algorithms» more  TACAS 2010»
14 years 7 months ago
Preemption Sealing for Efficient Concurrency Testing
The choice of where a thread scheduling algorithm preempts one thread in order to execute another is essential to reveal concurrency errors such as atomicity violations, livelocks,...
Thomas Ball, Sebastian Burckhardt, Katherine E. Co...
CAV
2005
Springer
144views Hardware» more  CAV 2005»
15 years 3 months ago
Romeo: A Tool for Analyzing Time Petri Nets
In this paper, we present the features of Romeo, a Time Petri Net (TPN) analyzer. The tool Romeo allows state space computation of TPN and on-the-fly model-checking of reachabilit...
Guillaume Gardey, Didier Lime, Morgan Magnin, Oliv...
APN
2005
Springer
15 years 3 months ago
The (True) Concurrent Markov Property and Some Applications to Markov Nets
Abstract. We study probabilistic safe Petri nets, a probabilistic extension of safe Petri nets interpreted under the true-concurrent semantics. In particular, the likelihood of pro...
Samy Abbes