372 search results - page 75 / 75 » Model Checking Commitment Protocols |
IANDC
2011
13 years 10 days ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
FMICS
2009
Springer
13 years 12 months ago
2009
Springer
on Abstraction: a Lightweight Approach to Modelling Concurrency. Javier de Dios and Ricardo Peña Certified Implementation on top of the Java Virtual Machine 19:00 Social dinner + ...