245 search results - page 8 / 49 » Efficient Symbolic Model Checking for Process Algebras |
FORMATS
2006
Springer
15 years 1 months ago
2006
Springer
In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic ...
ENTCS
2006
14 years 9 months ago
2006
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 ...
152
click to vote
FSTTCS
2010
Springer
14 years 6 months ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
ENTCS
2006
14 years 9 months ago
2006
Industry standards for Web Service composition, such as WSBPEL, provide the notation and additional control mechanisms for the execution of business processes in Web Service colla...
APLAS
2010
ACM
14 years 9 months ago
2010
ACM
Abstract. We propose a new method to verify that a higher-order, treeprocessing functional program conforms to an input/output specification. Our method reduces the verification pr...