default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHans Fleischhack
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2005
[c15]Christoph Eichner, Hans Fleischhack, Roland Meyer, Ulrik Schrimpf, Christian Stehno:
Compositional Semantics for UML 2.0 Sequence Diagrams Using Petri Nets. SDL Forum 2005: 133-148- 2003
- [c14]Elisabeth Pelz, Hans Fleischhack:
Compositional High Level Petri Nets with Timing Constraints - A Comparison. ACSD 2003: 132-141 - [c13]Hans Fleischhack, Elisabeth Pelz:
Hierarchical Timed High Level Nets and Their Branching Processes. ICATPN 2003: 397-416 - 2002
- [c12]Hans Fleischhack, Christian Stehno:
Computing a Finite Prefix of a Time Petri Net. ICATPN 2002: 163-181
1990 – 1999
- 1999
- [c11]Burkhard Bieber, Hans Fleischhack:
Model Checking of Time Petri Nets Based on Partial Order Semantics. CONCUR 1999: 210-225 - 1998
- [c10]Hans Fleischhack, Bernd Grahlmann:
A Compositional Petri Net Semantics for SDL. ICATPN 1998: 144-164 - [c9]Bernd Grahlmann, Hans Fleischhack:
Towards Compositional Verification of SDL Systems. HICSS (7) 1998: 404-414 - 1997
- [c8]Hans Fleischhack, Josef Tapken:
An M-Net Semantics for a Real-Time Extension of µSDL. FME 1997: 162-181 - [c7]Bernd Grahlmann, Hans Fleischhack:
A Petri Net Semantics for B(PN)2 with Procedures. PDSE 1997: 15-27 - 1995
- [c6]Eike Best, Hans Fleischhack, Wojciech Fraczak, Richard P. Hopkins, Hanna Klaudel, Elisabeth Pelz:
A Class of Composable High Level Petri Nets with an Application to the Semantics of B(PN)2. Application and Theory of Petri Nets 1995: 103-120 - [c5]Anja Gronewold, Hans Fleischhack:
Computing Petri Net Languages by Reductions. FCT 1995: 253-262 - [c4]Eike Best, Hans Fleischhack, Wojciech Fraczak, Richard P. Hopkins, Hanna Klaudel, Elisabeth Pelz:
An M-net Semantics of B(PN)2. STRICT 1995: 85-100 - 1992
- [c3]Hans Fleischhack:
P-Superfairness in Nets. Application and Theory of Petri Nets 1992: 193-204
1980 – 1989
- 1987
- [j1]Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig:
Diagonalizations over Polynomial Time Computable Sets. Theor. Comput. Sci. 51: 177-204 (1987) - [c2]Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig:
Diagonalizing over Deterministic Polynomial Time. CSL 1987: 1-16 - 1986
- [c1]Hans Fleischhack:
P-Genericity and Strong G-Genericity. MFCS 1986: 341-349 - 1985
- [b1]Hans Fleischhack:
On diaginalizations over complexity classes. Technical University of Dortmund, Germany, 1985, pp. 1-102
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
