default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWalter Vogler
- > Home > Persons > Walter Vogler
Publications
- 2014
[j52]Blai Bonet, Patrik Haslum, Victor Khomenko, Sylvie Thiébaux, Walter Vogler:
Recent advances in unfolding technique. Theor. Comput. Sci. 551: 84-101 (2014)- 2013
- [c69]Stanislavs Golubcovs, Walter Vogler, Norman Kluge:
STG-Based Resynthesis for Balsa Circuits. ACSD 2013: 140-149 - 2011
- [j48]Stephen A. Edwards
, Ryszard Janicki, Walter Vogler:
Preface. Fundam. Informaticae 108(1-2) (2011) - [j47]Dominic Wist, M. Schaefer, Walter Vogler, Ralf Wollowski:
Signal transition graph decomposition: internal communication for speed independent circuit implementation. IET Comput. Digit. Tech. 5(6): 440-451 (2011) - [c65]Dominic Wist, Walter Vogler, Ralf Wollowski:
STG Decomposition: Partitioning Heuristics. ACSD 2011: 141-150 - 2010
- [c61]Dominic Wist, Mark Schäfer, Walter Vogler, Ralf Wollowski:
STG Decomposition: Internal Communication for SI Implementability. ACSD 2010: 13-23 - 2009
- [j43]Victor Khomenko, Mark Schäfer, Walter Vogler, Ralf Wollowski:
STG decomposition strategies in combination with unfolding. Acta Informatica 46(6): 433-474 (2009) - [j42]Dominic Wist, Ralf Wollowski, Mark Schäfer, Walter Vogler:
Avoiding Irreducible CSC Conflicts by Internal Communication. Fundam. Informaticae 95(1): 1-29 (2009) - 2008
- [j41]Victor Khomenko, Mark Schäfer, Walter Vogler:
Output-Determinacy and Asynchronous Circuit Synthesis. Fundam. Informaticae 88(4): 541-579 (2008) - [c57]Mark Schäfer, Walter Vogler, Dominic Wist, Ralf Wollowski:
Avoiding irreducible CSC conflicts by internal communication. ACSD 2008: 3-12 - 2007
- [j35]Mark Schäfer, Walter Vogler:
Component refinement and CSC-solving for STG decomposition. Theor. Comput. Sci. 388(1-3): 243-266 (2007) - [c56]Victor Khomenko, Mark Schäfer, Walter Vogler:
Output-Determinacy and Asynchronous Circuit Synthesis. ACSD 2007: 147-156 - 2006
- [j33]Victor Khomenko, Alex Kondratyev, Maciej Koutny, Walter Vogler:
Merged processes: a new condensed representation of Petri net behaviour. Acta Informatica 43(5): 307-330 (2006) - [c54]Mark Schäfer, Walter Vogler, Ralf Wollowski, Victor Khomenko:
Strategies for Optimised STG Decomposition. ACSD 2006: 123-132 - 2005
- [c49]Mark Schäfer, Walter Vogler, Petr Jancar:
Determinate STG Decomposition of Marked Graphs. ICATPN 2005: 365-384 - [c48]Victor Khomenko, Alex Kondratyev, Maciej Koutny, Walter Vogler:
Merged Processes - A New Condensed Representation of Petri Net Behaviour. CONCUR 2005: 338-352 - [c45]Mark Schäfer, Walter Vogler:
Component Refinement and CSC Solving for STG Decomposition. FoSSaCS 2005: 348-363 - 2003
- [j27]Victor Khomenko, Maciej Koutny, Walter Vogler:
Canonical prefixes of Petri net unfoldings. Acta Informatica 40(2): 95-118 (2003) - 2002
- [j24]Javier Esparza, Stefan Römer, Walter Vogler:
An Improvement of McMillan's Unfolding Algorithm. Formal Methods Syst. Des. 20(3): 285-310 (2002) - [c40]Walter Vogler, Ralf Wollowski:
Decomposition in Asynchronous Circuit Design. Concurrency and Hardware Design 2002: 152-190 - [c39]Victor Khomenko, Maciej Koutny, Walter Vogler:
Canonical Prefixes of Petri Net Unfoldings. CAV 2002: 582-595 - [c38]Walter Vogler, Ralf Wollowski:
Decomposition in Asynchronous Circuit Design. FSTTCS 2002: 336-347 - 1998
- [c27]Walter Vogler, Alexei L. Semenov, Alexandre Yakovlev:
Unfolding and Finite Prefix for Nets with Read Arcs. CONCUR 1998: 501-516 - 1996
- [c21]Javier Esparza, Stefan Römer, Walter Vogler:
An Improvement of McMillan's Unfolding Algorithm. TACAS 1996: 87-106
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.
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.
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.
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 2025-07-06 19:36 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:
