Sciweavers

221 search results - page 11 / 45
» Algebraic Stuttering Simulations
Sort
View
ENTCS
2006
105views more  ENTCS 2006»
13 years 7 months ago
Monte Carlo Methods for Process Algebra
We review the recently developed technique of Monte Carlo model checking and show how it can be applied to the implementation problem for I/O Automata. We then consider some open ...
Radu Grosu, Scott A. Smolka
EURODAC
1994
IEEE
122views VHDL» more  EURODAC 1994»
13 years 12 months ago
Compiled-code-based simulation with timing verification
Due to the complexity of today's systems, prototyping by simulation must be based on simulation-engine-like performance. It is proved by implementations that compiler-driven ...
Winfried Hahn, Andreas Hagerer, C. Herrmann
ICALP
2005
Springer
14 years 1 months ago
Petri Algebras
The firing rule of Petri nets relies on a residuation operation for the commutative monoid of natural numbers. We identify a class of residuated commutative monoids, called Petri ...
Eric Badouel, Jules Chenou, Goulven Guillou
CONCUR
2006
Springer
13 years 11 months ago
On Finite Alphabets and Infinite Bases III: Simulation
This paper studies the (in)equational theory of simulation preorder and equivalence over the process algebra BCCSP. We prove that in the presence of a finite alphabet with at least...
Taolue Chen, Wan Fokkink
ICALP
2003
Springer
14 years 28 days ago
On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces
We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomatizability of ready trace semantics. We prove that if the alphabet of actions is finite, t...
Stefan Blom, Wan Fokkink, Sumit Nain