This paper presents the core concepts for PLC-statecharts–an adaptation of UML-
statecharts–which can be used as a visual programming language for PLCs. They combine …

We examine to what extent implementation of timed automata can be achieved using the
standard semantics and appropriate modeling, instead of introducing new semantics. We …

In this paper, we introduce a parametric semantics for timed controllers called the Almost
ASAP (as soon as possible) semantics. This semantics is a relaxation of the usual ASAP …

In this paper, we consider a syntactic subset of timed automata called integer reset timed
automata (IRTA) where resets are restricted to occur at integral time points. We argue with …

We define and study a new approach to the implementability of timed automata, where the
semantics is perturbed by imprecisions and finite frequency of the hardware. In order to …

The relevance of formal verification methods is widely recognized in the computer science
and embedded systems community. Recently, such methods have been introduced also …

Finite state machine (FSM) models are widely used to model the operations of computer
systems. Since the basic FSM model is timeless, it is not possible to model within the basic …

This paper defines an adaptation of UML-statecharts which can be used as a visual
programming language for PLCs. Those PLC-statecharts combine the advantages of UML …

In the model-based implementation methodology, the timed behavior of the software is
typically modeled independently of the platform-specific timing semantics such as the delay …

Today, many industrial products are defined by software, and therefore customizable by
installing new applications on demand-their functionalities are implemented by software and …