125 search results - page 6 / 25 » Bounded Model Checking of Compositional Processes |
GG
2008
Springer
13 years 8 months ago
2008
Springer
We introduce ranked open nets, a reactive extension of Petri nets which generalises a basic open net model introduced in a previous work by allowing for a refined notion of interf...
ISSTA
2004
ACM
14 years 10 days ago
2004
ACM
The use of XML as the de facto data exchange standard has allowed integration of heterogeneous web based software systems regardless of implementation platforms and programming la...
ICFEM
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate...
FDL
2006
IEEE
14 years 29 days ago
2006
IEEE
Reusing IP-cores to construct system models facilitated by automated generation of glue-logic, and automated composability checks can help designers to create efficient simulation...
ENTCS
2007
13 years 6 months ago
2007
Bounded Model Checking (BMC) is one of the most paradigmatic practical applications of Boolean Satisfiability (SAT). The utilization of SAT in model checking has allowed signifi...