Peter Habermehl

Available identifiers

zbMath Open habermehl.peterMaRDI QIDQ515662

List of research outcomes

Publication	Date of Publication	Type
On Presburger arithmetic extended with non-unary counting quantifiers	2023-08-26	Paper
Constrained properties, semilinear systems, and Petri nets	2023-06-28	Paper
On the complexity of the linear-time μ-calculus for Petri Nets	2022-12-09	Paper
Data-driven Numerical Invariant Synthesis with Automatic Generation of Attributes	2022-12-07	Paper
https://portal.mardi4nfdi.de/entity/Q4995360	2021-06-24	Paper
Model-Checking Counting Temporal Logics on Flat Structures	2020-05-27	Paper
Realizability of concurrent recursive programs	2018-11-15	Paper
Left-eigenvectors are certificates of the Orbit problem	2018-10-23	Paper
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations	2018-07-04	Paper
Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete	2018-05-14	Paper
On the path-width of integer linear programming	2017-03-16	Paper
Regular Transformations of Data Words Through Origin Information	2016-06-10	Paper
On Presburger Arithmetic Extended with Modulo Counting Quantifiers	2015-10-01	Paper
A Robust Class of Data Languages and an Application to Learning	2015-01-15	Paper
Ordered Navigation on Multi-attributed Data Words	2014-09-15	Paper
Learning Transparent Data Automata	2014-07-08	Paper
Forest automata for verification of heap manipulation	2014-03-28	Paper
https://portal.mardi4nfdi.de/entity/Q2852015	2013-10-07	Paper
https://portal.mardi4nfdi.de/entity/Q2851061	2013-10-02	Paper
A Fresh Approach to Learning Register Automata	2013-06-28	Paper
https://portal.mardi4nfdi.de/entity/Q2904765	2012-08-23	Paper
ON YEN'S PATH LOGIC FOR PETRI NETS	2011-07-14	Paper
Programs with lists are counter automata	2011-05-23	Paper
The Downward-Closure of Petri Net Languages	2010-09-07	Paper
On the Use of Non-deterministic Automata for Presburger Arithmetic	2010-08-31	Paper
CONCUR 2003 - Concurrency Theory	2010-03-30	Paper
Automata-based verification of programs with tree updates	2010-02-05	Paper
On Yen’s Path Logic for Petri Nets	2009-11-19	Paper
Automatic Verification of Integer Array Programs	2009-06-30	Paper
Realizability of Concurrent Recursive Programs	2009-03-31	Paper
Abstract Regular Tree Model Checking of Complex Dynamic Data Structures	2009-03-12	Paper
Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata	2009-02-12	Paper
A Logic of Singly Indexed Arrays	2009-01-27	Paper
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete	2008-10-30	Paper
Proving Termination of Tree Manipulating Programs	2008-07-03	Paper
Verification of parametric concurrent systems with prioritised FIFO resource management	2008-04-11	Paper
What Else Is Decidable about Integer Arrays?	2008-04-11	Paper
Rewriting Systems with Data	2008-02-26	Paper
Programs with Lists Are Counter Automata	2007-09-05	Paper
Tools and Algorithms for the Construction and Analysis of Systems	2007-05-02	Paper
Tools and Algorithms for the Construction and Analysis of Systems	2005-11-10	Paper
Computer Aided Verification	2005-08-25	Paper
Automata, Languages and Programming	2005-08-24	Paper
https://portal.mardi4nfdi.de/entity/Q4817540	2004-09-24	Paper
Automatic verification of recursive procedures with one integer parameter.	2003-08-17	Paper
https://portal.mardi4nfdi.de/entity/Q4785460	2003-01-01	Paper
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations	2000-01-12	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Peter Habermehl