Sciweavers

1521 search results - page 15 / 305
» On Sampled Semantics of Timed Systems
Sort
View
APN
2003
Springer
13 years 11 months ago
Reactive Petri Nets for Workflow Modeling
Abstract. Petri nets are widely used for modeling and analyzing workflows. Using the token-game semantics, Petri net-based workflow models can be analyzed before the model is actua...
Rik Eshuis, Juliane Dehnert
SEMWEB
2007
Springer
14 years 1 months ago
Sampling and Soundness: Can We Have Both?
Recent research on model counting in CNF formulas has shown that a certain sampling method can yield results that are sound with a provably high probability. The key idea is to ite...
Carla P. Gomes, Jörg Hoffmann, Ashish Sabharw...
IANDC
2006
126views more  IANDC 2006»
13 years 7 months ago
Coalgebraic semantics for timed processes
We give a coalgebraic formulation of timed processes and their operational semantics. We model time by a monoid called a "time domain", and we model processes by "t...
Marco Kick, John Power, Alex Simpson
FOSSACS
2008
Springer
13 years 9 months ago
Robust Analysis of Timed Automata via Channel Machines
Whereas formal verification of timed systems has become a very active field of research, the idealised mathematical semantics of timed automata cannot be faithfully implemented. Se...
Patricia Bouyer, Nicolas Markey, Pierre-Alain Reyn...
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
13 years 11 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill