default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWalter Vogler
Person information
- affiliation: University of Augsburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j67]Ayleen Schinko, Walter Vogler, Johannes Gareis, N. Tri Nguyen, Gerald Lüttgen
:
Interface Automata for Shared Memory. Acta Informatica 59(5): 521-556 (2022)- 2021
- [j66]Walter Vogler, Gerald Lüttgen:
Correction to: A linear-time branching-time perspective on interface automata. Acta Informatica 58(6): 677 (2021) - [j65]Antti Valmari, Walter Vogler:
Stubborn Sets, Frozen Actions, and Fair Testing. Fundam. Informaticae 178(1-2): 139-172 (2021) - 2020
- [j64]Walter Vogler, Gerald Lüttgen:
A linear-time branching-time perspective on interface automata. Acta Informatica 57(3-5): 513-550 (2020)
2010 – 2019
- 2019
- [c78]Vitali Schneider, Walter Vogler:
Modal Open Petri Nets. Petri Nets 2019: 25-46 - 2018
- [j63]Ayleen Schinko, Walter Vogler:
Fault-Free Refinements for Interface Automata. Sci. Ann. Comput. Sci. 28(2): 289-337 (2018) - [j62]Antti Valmari, Walter Vogler:
Fair testing and stubborn sets. Int. J. Softw. Tools Technol. Transf. 20(5): 589-610 (2018) - [c77]Ayleen Schinko, Walter Vogler:
Fault-Free Refinements for Interface Automata. ACSD 2018: 85-94 - [c76]Johannes Gareis, Gerald Lüttgen, Ayleen Schinko, Walter Vogler:
Interface Automata for Shared Memory. Models, Mindsets, Meta 2018: 151-166 - 2017
- [j61]Richard Müller, Christian Stahl, Walter Vogler:
Deciding conformance for bounded responsiveness. Sci. Comput. Program. 138: 1-25 (2017) - [j60]Ferenc Bujtor, Walter Vogler:
ACTL for Modal Interface Automata. Theor. Comput. Sci. 693: 13-34 (2017) - [j59]Ferenc Bujtor, Lev Sorokin, Walter Vogler:
Testing Preorders for dMTS: Deadlock- and the New Deadlock-/DivergenceTesting. ACM Trans. Embed. Comput. Syst. 16(2): 41:1-41:28 (2017) - 2016
- [j58]Ferenc Bujtor, Sascha Fendrich, Gerald Lüttgen, Walter Vogler:
Nondeterministic Modal Interfaces. Theor. Comput. Sci. 642: 24-53 (2016) - [c75]Ferenc Bujtor, Walter Vogler:
ACTL for Modal Interface Automata. ACSD 2016: 1-10 - [c74]Antti Valmari, Walter Vogler:
Fair Testing and Stubborn Sets. SPIN 2016: 225-243 - 2015
- [j57]Gerald Lüttgen, Walter Vogler, Sascha Fendrich:
Richer interface automata with optimistic and pessimistic compatibility. Acta Informatica 52(4-5): 305-336 (2015) - [j56]Ferenc Bujtor, Walter Vogler:
Error-pruning in interface automata. Theor. Comput. Sci. 597: 18-39 (2015) - [j55]Ferenc Bujtor, Walter Vogler:
Failure Semantics for Modal Transition Systems. ACM Trans. Embed. Comput. Syst. 14(4): 67:1-67:30 (2015) - [c73]Ferenc Bujtor, Lev Sorokin, Walter Vogler:
Testing Preorders for dMTS: Deadlock- and the New Deadlock/Divergence-Testing. ACSD 2015: 60-69 - [c72]Ferenc Bujtor, Sascha Fendrich, Gerald Lüttgen, Walter Vogler:
Nondeterministic Modal Interfaces. SOFSEM 2015: 152-163 - 2014
- [j54]Walter Vogler, Christian Stahl, Richard Müller:
Trace- and failure-based semantics for responsiveness. Acta Informatica 51(8): 499-552 (2014) - [j53]Richard Müller, Christian Stahl, Walter Vogler:
Undecidability of accordance for open systems with unbounded message queues. Inf. Process. Lett. 114(12): 663-669 (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) - [c71]Ferenc Bujtor, Walter Vogler:
Failure Semantics for Modal Transition Systems. ACSD 2014: 42-51 - [c70]Ferenc Bujtor, Walter Vogler:
Error-Pruning in Interface Automata. SOFSEM 2014: 162-173 - 2013
- [j51]Gerald Lüttgen, Walter Vogler:
Modal Interface Automata. Log. Methods Comput. Sci. 9(3) (2013) - [j50]Gerald Lüttgen, Walter Vogler:
Richer Interface Automata with Optimistic and Pessimistic Compatibility. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 66 (2013) - [c69]Stanislavs Golubcovs, Walter Vogler, Norman Kluge:
STG-Based Resynthesis for Balsa Circuits. ACSD 2013: 140-149 - [c68]Walter Vogler, Christian Stahl, Richard Müller:
Trace- and Failure-Based Semantics for Bounded Responsiveness. ESOCC Workshops 2013: 129-143 - 2012
- [j49]Christian Stahl, Walter Vogler:
A trace-based service semantics guaranteeing deadlock freedom. Acta Informatica 49(2): 69-103 (2012) - [c67]Walter Vogler, Christian Stahl, Richard Müller:
A Trace-Based Semantics for Responsiveness. ACSD 2012: 42-51 - [c66]Gerald Lüttgen, Walter Vogler:
Modal Interface Automata. IFIP TCS 2012: 265-279 - 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) - [j46]Gerald Lüttgen, Walter Vogler:
Safe reasoning with Logic LTS. Theor. Comput. Sci. 412(28): 3337-3357 (2011) - [c65]Dominic Wist, Walter Vogler, Ralf Wollowski:
STG Decomposition: Partitioning Heuristics. ACSD 2011: 141-150 - [c64]Christian Stahl, Walter Vogler:
A Trace-Based View on Operating Guidelines. FoSSaCS 2011: 411-425 - [c63]Flavio Corradini, Maria Rita Di Berardini, Walter Vogler:
Read Operators and their Expressiveness in Process Algebras. EXPRESS 2011: 31-43 - [c62]Federico Buti, Massimo Callisto De Donato, Flavio Corradini, Maria Rita Di Berardini, Walter Vogler:
Automated Analysis of MUTEX Algorithms with FASE. GandALF 2011: 45-59 - [i9]Federico Buti, Massimo Callisto De Donato, Flavio Corradini, Maria Rita Di Berardini, Walter Vogler:
Evaluating the Efficiency of Asynchronous Systems with FASE. CoRR abs/1105.1369 (2011) - 2010
- [j45]Gerald Lüttgen, Walter Vogler:
Ready simulation for concurrency: It's logical! Inf. Comput. 208(7): 845-867 (2010) - [c61]Dominic Wist, Mark Schäfer, Walter Vogler, Ralf Wollowski:
STG Decomposition: Internal Communication for SI Implementability. ACSD 2010: 13-23
2000 – 2009
- 2009
- [j44]Flavio Corradini, Maria Rita Di Berardini, Walter Vogler:
Liveness of a mutex algorithm in a fair process algebra. Acta Informatica 46(3): 209-235 (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) - [c60]Flavio Corradini, Maria Rita Di Berardini, Walter Vogler:
Time and Fairness in a Process Algebra with Non-blocking Reading. SOFSEM 2009: 193-204 - [c59]Gerald Lüttgen, Walter Vogler:
Safe Reasoning with Logic LTS. SOFSEM 2009: 376-387 - [c58]Katrin Iltgen, Walter Vogler:
Robustness of a bisimulation-type faster-than preorder. EXPRESS 2009: 66-79 - 2008
- [j41]Victor Khomenko, Mark Schäfer, Walter Vogler:
Output-Determinacy and Asynchronous Circuit Synthesis. Fundam. Informaticae 88(4): 541-579 (2008) - [j40]Walter Vogler:
Another short proof of optimality for the MIN cache replacement algorithm. Inf. Process. Lett. 106(5): 219-220 (2008) - [c57]Mark Schäfer, Walter Vogler, Dominic Wist, Ralf Wollowski:
Avoiding irreducible CSC conflicts by internal communication. ACSD 2008: 3-12 - 2007
- [j39]Walter Vogler, Ben Kangsah:
Improved Decomposition of Signal Transition Graphs. Fundam. Informaticae 78(1): 161-197 (2007) - [j38]Arend Rensink, Walter Vogler:
Fair testing. Inf. Comput. 205(2): 125-198 (2007) - [j37]Flavio Corradini, Walter Vogler:
Performance of pipelined asynchronous systems. J. Log. Algebraic Methods Program. 70(2): 201-221 (2007) - [j36]Gerald Lüttgen, Walter Vogler:
Conjunction on processes: Full abstraction via ready-tree semantics. Theor. Comput. Sci. 373(1-2): 19-40 (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 - [c55]Gerald Lüttgen, Walter Vogler:
Ready Simulation for Concurrency: It's Logical! ICALP 2007: 752-763 - 2006
- [j34]Flavio Corradini, Maria Rita Di Berardini, Walter Vogler:
Fairness of Actions in System Computations. Acta Informatica 43(2): 73-130 (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) - [j32]Flavio Corradini, Maria Rita Di Berardini, Walter Vogler:
Fairness of components in system computations. Theor. Comput. Sci. 356(3): 291-324 (2006) - [j31]Gerald Lüttgen, Walter Vogler:
Bisimulation on speed: A unified approach. Theor. Comput. Sci. 360(1-3): 209-227 (2006) - [c54]Mark Schäfer, Walter Vogler, Ralf Wollowski, Victor Khomenko:
Strategies for Optimised STG Decomposition. ACSD 2006: 123-132 - [c53]Flavio Corradini, Maria Rita Di Berardini, Walter Vogler:
Checking a Mutex Algorithm in a Process Algebra with Fairness. CONCUR 2006: 142-157 - [c52]Gerald Lüttgen, Walter Vogler:
Conjunction on Processes: Full-Abstraction Via Ready-Tree Semantics. FoSSaCS 2006: 261-276 - [c51]Marcos E. Kurbán, Peter Niebert, Hongyang Qu, Walter Vogler:
Stronger Reduction Criteria for Local First Search. ICTAC 2006: 108-122 - 2005
- [j30]Gerald Lüttgen, Walter Vogler:
Bisimulation on speed: Lower time bounds. RAIRO Theor. Informatics Appl. 39(3): 587-618 (2005) - [j29]Flavio Corradini, Walter Vogler:
Measuring the performance of asynchronous systems with PAFAS. Theor. Comput. Sci. 335(2-3): 187-213 (2005) - [c50]Walter Vogler, Ben Kangsah:
Improved Decomposition of STGs. ACSD 2005: 244-253 - [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 - [c47]Flavio Corradini, Walter Vogler:
Performance of Pipelined Asynchronous Systems. FORMATS 2005: 242-257 - [c46]Gerald Lüttgen, Walter Vogler:
Bisimulation on Speed: A Unified Approach. FoSSaCS 2005: 79-94 - [c45]Mark Schäfer, Walter Vogler:
Component Refinement and CSC Solving for STG Decomposition. FoSSaCS 2005: 348-363 - 2004
- [j28]Gerald Lüttgen, Walter Vogler:
Bisimulation on speed: worst-case efficiency. Inf. Comput. 191(2): 105-144 (2004) - [c44]Gerald Lüttgen, Walter Vogler:
Bisimulation on Speed: Lower Time Bounds. FoSSaCS 2004: 333-347 - [c43]Elmar Bihler, Walter Vogler:
Timed Petri Nets: Efficiency of Asynchronous Systems. SFM 2004: 25-58 - [c42]Flavio Corradini, Maria Rita Di Berardini, Walter Vogler:
Fairness of Components in System Computations. EXPRESS 2004: 35-52 - 2003
- [j27]Victor Khomenko, Maciej Koutny, Walter Vogler:
Canonical prefixes of Petri net unfoldings. Acta Informatica 40(2): 95-118 (2003) - [j26]Walter Vogler:
Faster asynchronous systems. Inf. Comput. 184(2): 311-342 (2003) - [c41]Flavio Corradini, Maria Rita Di Berardini, Walter Vogler:
Relating Fairness and Timing in Process Algebras. CONCUR 2003: 438-452 - [e2]Walter Vogler, Kim Larsen:
Proceedings of the International Workshop on Models for Time-Critical Systems, MTCS 2002, CONCUR 2002 Satellite Workshop, Brno, Czech Republic, August 24, 2002. Electronic Notes in Theoretical Computer Science 68(5), Elsevier 2003 [contents] - 2002
- [j25]Flavio Corradini, Walter Vogler, Lars Jenner:
Comparing the worst-case efficiency of asynchronous systems with PAFAS. Acta Informatica 38(11/12): 735-792 (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) - [j23]Walter Vogler:
Efficiency of asynchronous systems, read arcs, and the MUTEX-problem. Theor. Comput. Sci. 275(1-2): 589-631 (2002) - [j22]Walter Vogler:
Partial order semantics and read arcs. Theor. Comput. Sci. 286(1): 33-63 (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 - [c37]Walter Vogler, Kim Larsen:
Preface. MTCS 2002: 135-136 - [e1]Flavio Corradini, Walter Vogler:
Proceedings of the International Workshop on Models for Time-Critical Systems, MTCS 2001, Satellite Event of CONCUR 2001, Aalborg, Denmark, August 25, 2001. Electronic Notes in Theoretical Computer Science 52(3), Elsevier 2002 [contents] - 2001
- [j21]Lars Jenner, Walter Vogler:
Fast asynchronous systems in dense time. Theor. Comput. Sci. 254(1-2): 379-422 (2001) - [c36]Flavio Corradini, Maria Rita Di Berardini, Walter Vogler:
PAFAS at Work: Comparing the Worst-Case Efficiency of Three Buffer Implementations. APAQS 2001: 231-240 - [c35]Walter Vogler:
Partial S-Invariants for the Verification of Infinite Systems Families. ICATPN 2001: 382-402 - [c34]Gerald Lüttgen, Walter Vogler:
A Faster-than Relation for Asynchronous Processes. CONCUR 2001: 262-276 - [c33]Flavio Corradini, Walter Vogler:
Preface. MTCS 2001: 323-324 - 2000
- [c32]Walter Vogler:
Efficiency of Asynchronous Systems That Communicate Asynchronously. ICATPN 2000: 424-444 - [c31]Walter Vogler, Lars Jenner:
Axiomatizing a Fragment of PAFAS. MTCS 2000: 306-321
1990 – 1999
- 1999
- [c30]Walter Vogler:
Concurrent Implementation of Asynchronous Transition Systems. ICATPN 1999: 284-303 - [c29]Lars Jenner, Walter Vogler:
Comparing the Efficiency of Asynchronous Systems. ARTS 1999: 172-191 - 1998
- [c28]Elmar Bihler, Walter Vogler:
Efficiency of Token-Passing MUTEX-Solutions - Some Experiments. ICATPN 1998: 185-204 - [c27]Walter Vogler, Alexei L. Semenov, Alexandre Yakovlev:
Unfolding and Finite Prefix for Nets with Read Arcs. CONCUR 1998: 501-516 - 1997
- [c26]Walter Vogler:
A Short STory on Action Refinement. Foundations of Computer Science: Potential - Theory - Cognition 1997: 271-278 - [c25]Walter Vogler:
Efficiency of Asynchronous Systems and Read Arcs in Petri Nets. ICALP 1997: 538-548 - [c24]Walter Vogler:
Partial Order Semantics and Read Arcs. MFCS 1997: 508-517 - 1996
- [j20]Walter Vogler:
The Limit of Splitn-Language Equivalence. Inf. Comput. 127(1): 41-61 (1996) - [c23]Ed Brinksma, Arend Rensink, Walter Vogler:
Applications of Fair Testing. FORTE 1996: 145-160 - [c22]Lars Jenner, Walter Vogler:
Fast Asynchronous Systems in Dense Time. ICALP 1996: 75-86 - [c21]Javier Esparza, Stefan Römer, Walter Vogler:
An Improvement of McMillan's Unfolding Algorithm. TACAS 1996: 87-106 - 1995
- [j19]Walter Vogler:
Generalized OM-Bisimulation. Inf. Comput. 118(1): 38-47 (1995) - [j18]Walter Vogler:
Timed Testing of Concurrent Systems. Inf. Comput. 121(2): 149-171 (1995) - [j17]Walter Vogler:
Fairness and Partial Order Semantics. Inf. Process. Lett. 55(1): 33-39 (1995) - [c20]Walter Vogler:
Faster Asynchronous Systems. CONCUR 1995: 299-312 - [c19]Ed Brinksma, Arend Rensink, Walter Vogler:
Fair Testing. CONCUR 1995: 313-327 - [c18]Walter Vogler:
The Limit of Split_n-Language Equivalence. ICALP 1995: 636-647 - [c17]Walter Vogler:
Partial Order Semantics and Weak Fairness. STRICT 1995: 341-350 - 1993
- [j16]Walter Vogler:
On Hyperedge Replacement and BNLC Graph Grammars. Discret. Appl. Math. 46(3): 253-273 (1993) - [j15]Walter Vogler:
Bisimulation and Action Refinement. Theor. Comput. Sci. 114(1): 173-200 (1993) - [c16]Walter Vogler:
Timed Testing of Concurrent Systems. ICALP 1993: 532-543 - 1992
- [b1]Walter Vogler:
Modular Construction and Partial Order Semantics of Petri Nets. Lecture Notes in Computer Science 625, Springer 1992, ISBN 3-540-55767-9 - [j14]Robert Gold, Walter Vogler:
Quality criteria for partial order semantics of place/transition-nets with capacities. Fundam. Informaticae 17(3): 187-209 (1992) - [c15]Walter Vogler:
Asynchronous Communication of Petri Nets and the Refinement of Transitions. ICALP 1992: 605-616 - [p1]Walter Vogler:
Partial words versus processes: a short comparison. Advances in Petri Nets: The DEMON Project 1992: 292-303 - 1991
- [j13]Walter Vogler:
Failures Semantics Based on Interval Semiwords is a Congruence for Refinement. Distributed Comput. 4: 139-162 (1991) - [j12]Walter Vogler:
A generalization of traces. RAIRO Theor. Informatics Appl. 25: 147-156 (1991) - [j11]Annegret Habel, Hans-Jörg Kreowski, Walter Vogler:
Decidable Boundedness Problems for Sets of Graphs Generated by Hyperedge-Replacement. Theor. Comput. Sci. 89(1): 33-62 (1991) - [j10]Walter Vogler:
Executions: A New Partial-Order Semantics of Petri Nets. Theor. Comput. Sci. 91(2): 205-238 (1991) - [c14]Walter Vogler:
Deciding History Preserving Bisimilarity. ICALP 1991: 495-505 - [c13]Walter Vogler:
Bisimulation and Action Refinement. STACS 1991: 309-321 - [i8]Walter Vogler:
Asynchronous communication of Petri nets and the refinements of transitions. Forschungsberichte, TU Munich SFB 917: 1-33 (1991) - [i7]Walter Vogler:
Is partial order semantics necessary for action refinement? Forschungsberichte, TU Munich TUM I 9101: 1-23 (1991) - [i6]Walter Vogler:
Generalized OM-bisimulation. Forschungsberichte, TU Munich TUM I 9113: 1-13 (1991) - 1990
- [c12]Walter Vogler:
Recognizing Edge Replacement Graph Languages in Cubic Time. Graph-Grammars and Their Application to Computer Science 1990: 676-687 - [c11]Robert Gold, Walter Vogler:
Quality Criteria for Partial Order Semantics of Place/Transition-Nets. MFCS 1990: 306-312 - [c10]Walter Vogler:
Failures Semantics Based on Interval Semiwords is a Congruence for Refinement. STACS 1990: 285-297 - [i5]Walter Vogler:
Failures semantics of Petri nets and the refinement of places and transitions. Forschungsberichte, TU Munich TUM I 9003: 1-40 (1990) - [i4]Robert Gold, Walter Vogler:
Quality criteria for partial order semantics of place/transitions nets. Forschungsberichte, TU Munich TUM I 9004: 1-22 (1990) - [i3]Walter Vogler:
Recognizing edge replacement graph languages in cubic time. Forschungsberichte, TU Munich TUM I 9017: 1-14 (1990) - [i2]Walter Vogler:
A generalization of trace theory. Forschungsberichte, TU Munich TUM I 9018: 1-12 (1990) - [i1]Walter Vogler:
Bisimulation and action refinement. Forschungsberichte, TU Munich TUM I 9020: 1-36 (1990)
1980 – 1989
- 1989
- [j9]Walter Vogler:
Failures Semantics and Deadlocking of Modular Petri Nets. Acta Informatica 26(4): 333-348 (1989) - [j8]Annegret Habel, Hans-Jörg Kreowski, Walter Vogler:
Metatheorems for Decision Problems on Hyperedge Replacement Graph Languages. Acta Informatica 26(7): 657-677 (1989) - [j7]Dirk Taubner, Walter Vogler:
Step Failures Semantics and a Complete Proof System. Acta Informatica 27(2): 125-156 (1989) - [j6]Volker Diekert, Walter Vogler:
On the Synchronization of Traces. Math. Syst. Theory 22(3): 161-175 (1989) - [c9]Wilfried Brauer, Robert Gold, Walter Vogler:
A survey of behaviour and equivalence preserving refinements of Petri nets. Applications and Theory of Petri Nets 1989: 1-46 - [c8]Annegret Habel, Hans-Jörg Kreowski, Walter Vogler:
Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammar. TAPSOFT, Vol.1 1989: 275-289 - [c7]Walter Vogler:
On Hyperedge Replacement and BNLC Graph Grammars. WG 1989: 78-93 - 1988
- [c6]Walter Vogler:
Representation of a swapping class by one net. European Workshop on Applications and Theory in Petri Nets 1988: 467-486 - [c5]Volker Diekert, Walter Vogler:
Local Checking of Trace Synchroniziability. MFCS 1988: 271-279 - [c4]Walter Vogler:
Failures Semantics and Deadlocking of Modular Petri Nets. MFCS 1988: 542-551 - 1987
- [j5]Annegret Habel, Hans-Jörg Kreowski, Walter Vogler:
Complativle graph properties are decidable for hypergraph replacement graph languages. Bull. EATCS 33: 55-61 (1987) - [c3]Dirk Taubner, Walter Vogler:
The Step Failure Semantics. STACS 1987: 348-359 - [c2]Walter Vogler:
An Improved Multiple Identification Algorithm for Synchronous Broadcasting Networks. WDAG 1987: 84-91 - 1986
- [j4]Walter Vogler:
Representing abstract groups by powers of a graph. J. Comb. Theory B 40(1): 81-93 (1986) - [c1]Walter Vogler:
Behaviour Preserving Refinement of Petri Nets. WG 1986: 82-93 - 1985
- [j3]Reinhard Diestel, Rudolf Halin, Walter Vogler:
Some remarks on universal graphs. Comb. 5(4): 283-293 (1985) - [j2]George Hendry, Walter Vogler:
The square of a connected S(K1, 3)-free graph is vertex pancyclic. J. Graph Theory 9(4): 535-537 (1985) - 1984
- [j1]Walter Vogler:
Graphs with given group and given constant link. J. Graph Theory 8(1): 111-115 (1984)
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-06-10 21:23 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:
