We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
In this paper we present two algorithms that effectively synthesize a finite place/transition Petri net (p/t-net) from a finite set of labeled partial orders (a finite partial lang...
Synthesis of asynchronous circuits from Signal Transition Graphs (STGs) involves resolution of state encoding conflicts by means of refining the STG specification. In this paper, ...
This paper proposes a new approach for the hazard checking of timed asynchronous circuits. Previous papers proposed either exact algorithms, which suffer from statespace explosion...
We describe a translation from Rebeca, an actorbased language, to mCRL2, a process algebra enhanced with data types. The main motivation is to exploit the verification tools and ...
Hossein Hojjat, Marjan Sirjani, Mohammad Reza Mous...
We study sensor minimization problems in the context of fault diagnosis. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in...
Today there are many process mining techniques that allow for the automatic construction of process models based on event logs. Unlike synthesis techniques (e.g., based on regions...
The software design is one of the most challenging tasks during the design of a mechatronic system. On one hand, it has to provide solutions to deal with concurrency and timelines...
Jinfeng Huang, Jeroen Voeten, Marcel A. Groothuis,...
In this paper we show how to use labelled event structures as a unique mathematical representation for design models consisting of different UML 2.0 diagrams/notation. Each diagra...
Modern multiprocessor embedded systems execute a large number of tasks on shared processors and handle their complex communications on shared communication networks. Traditional m...
Lothar Thiele, Iuliana Bacivarov, Wolfgang Haid, K...