Michael Geisinger

dblp:52/8927 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 2Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Automated reasoning and model checking · 77% Logic in computer science · 23%
Software engineering, system software, and programming languages
1 paper
Program synthesis and code generation · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program synthesis and code generation › controller synthesis
reactive synthesis
0.112012
MGSyn: Automatic Synthesis for Industrial Automation · CAV 2012
Automated reasoning and model checking › synthesis
program synthesis
0.112012
Game solving for industrial automation and control · ICRA 2012
Embedded and real-time systems › cyber-physical system platforms
industrial automation
0.012012
MGSyn: Automatic Synthesis for Industrial Automation · CAV 2012
Logic in computer science › temporal logic
linear temporal logic
0.012012
Game solving for industrial automation and control · ICRA 2012

Methods — techniques the papers use, named apart from their topics

synthesis · 0.3two-player game solving · 0.1PDDL · 0.1
YearPublicationVenuePosition
2013 Synthesizing Controllers for Automation Tasks with Performance Guarantees
Chih-Hong Cheng, Michael Geisinger, Christian Buckl
SPIN2
2012 MGSyn: Automatic Synthesis for Industrial Automation
Chih-Hong Cheng, Michael Geisinger, Harald Ruess, Christian Buckl, Alois C. Knoll
CAV2
2012 Game solving for industrial automation and control
abstract
An ongoing effort within the community of verification and program analysis is to raise the level of abstraction in programming by automatic synthesis. In this paper, we demonstrate how our synthesis engine GAVS+ achieves this goal by automatically creating control code for the FESTO Modular Production System. The overall approach is model-driven: we reinterpret planning domain definition language (PDDL) as a design contract to model two-player games played between control and environment, such that users can describe (i) basic abilities of hardware components, including sensors (as environment moves) and actuators (as control moves), (ii) topologies how components are interconnected, and (iii) desired specification under a restricted class of linear temporal logic. The model is processed by our game-based synthesis engine, from which intermediate code is generated. By mapping each behavioral-level action to a sequence of low-level PLC control commands, we transform the intermediate code into an executable program. The efficiency of our engine enables to synthesize every scenario presented in this paper within seconds. When the specification evolves, this implies a huge time-gain compared to manual program modification.
Chih-Hong Cheng, Michael Geisinger, Harald Ruess, Christian Buckl, Alois C. Knoll
ICRA2
2010 Model-based specification of timing requirements
abstract
In the past, model-based development focused mainly on functional and structural aspects of the system to be developed. Recently, several approaches to include timing aspects have been suggested. However, these approaches are typically applied in later development phases. Models specifying the requirements with respect to timing without focusing on a specific solution are missing. For example, few models support the specification of the allowed jitter of a system. In this paper, we identify requirements on languages for modeling the desired timing behavior of hard and soft real-time systems by analyzing different application domains. Based on these results, we evaluate existing approaches with respect to their suitability and present a suitable approach. Finally, this paper describes the application of the suggested approach in the context of an example from the automation domain.
Christian Buckl, Irina Gaponova, Michael Geisinger, Alois C. Knoll, Edward A. Lee
EMSOFT3