Bounded model checking has been recently introduced as an efficient verification method for reactive systems. In this work we apply bounded model checking to asynchronous systems....
We present several interpretations of the behavior of P/T nets in terms of traces, event structures, and partial orders. Starting from results of Hoogers, Kleijn and Thiagarajan, w...
The Meta-Object Facility (MOF) provides a standardised framework for object-oriented models. An instance of a MOF model contains objects and links whose interfaces are entirely de...
Priority is a frequently used feature of many computational systems. In this paper we study the expressiveness of two process algebras enriched with different priority mechanisms...
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...