Component-based approaches to program synthesis assemble programs from a database
of existing components, such as methods provided by an API. In this paper, we present a …

We address two aspects of constructing plans efficiently by means of satisfiability testing:
efficient encoding of the problem of existence of plans of a given number t of time points in …

Reduction to SAT is a very successful approach to solving hard combinatorial problems in
Artificial Intelligence and computer science in general. Most commonly, problem instances …

Due to their appealing conceptual simplicity and availability of computer tools for their
analysis, Petri nets are widely used to model discrete-event systems in many areas of …

This article transfers concepts and methods from business process modeling and workflow
management to the field of learnflows, ie learning and teaching processes. It is first shown …

Formal verification is becoming a fundamental step of safety-critical and model-based
software development. As part of the verification process, model checking is one of the …

Bounded reachability analysis and bounded model checking are widely believed to perform
poorly when using decision diagrams instead of SAT procedures. Recent research suggests …

This paper discusses bounded model checking (BMC) for asynchronous systems. Bounded
model checking is a technique that employs the power of efficient SAT and SMT solvers for …

We present a highly efficient boolean satisfiability (SAT) formulation for deadlock detection
and avoidance in concurrent programs modeled by Gadara nets, a class of Petri nets. The …

In this work, novel symbolic step encodings of the transition relation for object based
communicating state machines are presented. This class of systems is tailored to capture the …