Sciweavers

681 search results - page 67 / 137
» A Logic for True Concurrency
Sort
View
AUTOMATICA
2011
15 years 1 months ago
Timing and liveness in continuous Petri nets
Fluidification constitutes a relaxation technique for studying discrete event systems through fluidified approximated models, thus avoiding the state explosion problem. Moreove...
Carlos Renato Vázquez, Manuel Silva
POPL
2009
ACM
16 years 6 months ago
The theory of deadlock avoidance via discrete control
Deadlock in multithreaded programs is an increasingly important problem as ubiquitous multicore architectures force parallelization upon an ever wider range of software. This pape...
Manjunath Kudlur, Scott A. Mahlke, Stéphane...
CADE
2008
Springer
16 years 6 months ago
Model Checking for Stability Analysis in Rely-Guarantee Proofs
Rely-guarantee (RG) reasoning is useful for modular Hoare-style proofs of concurrent programs. However, RG requires that assertions be proved stable under the actions of the enviro...
Hasan Amjad, Richard Bornat
SCAI
2001
15 years 7 months ago
Meaning and Partiality Revised
Muskens presents in Meaning and Partiality a semantics of possibly contradictory beliefs and other propositional attitudes. We propose a different partial logic based on a few key...
Jørgen Villadsen
APN
2010
Springer
15 years 11 months ago
Factorization Properties of Symbolic Unfoldings of Colored Petri Nets
The unfolding technique is an efficient tool to explore the runs of a Petri net in a true concurrency semantics, i.e. without constructing all the interleavings of concurrent actio...
Thomas Chatain, Eric Fabre