| 2009 |
|---|
| 97 | EE | Flavio Corradini,
Maria Rita Di Berardini,
Walter Vogler:
Time and Fairness in a Process Algebra with Non-blocking Reading.
SOFSEM 2009: 193-204 |
| 96 | EE | Gerald Lüttgen,
Walter Vogler:
Safe Reasoning with Logic LTS.
SOFSEM 2009: 376-387 |
| 2008 |
|---|
| 95 | EE | Mark Schäfer,
Walter Vogler,
Dominic Wist,
Ralf Wollowski:
Avoiding irreducible CSC conflicts by internal communication.
ACSD 2008: 3-12 |
| 94 | EE | Victor Khomenko,
Mark Schäfer,
Walter Vogler:
Output-Determinacy and Asynchronous Circuit Synthesis.
Fundam. Inform. 88(4): 541-579 (2008) |
| 93 | EE | Walter Vogler:
Another short proof of optimality for the MIN cache replacement algorithm.
Inf. Process. Lett. 106(5): 219-220 (2008) |
| 2007 |
|---|
| 92 | EE | Victor Khomenko,
Mark Schäfer,
Walter Vogler:
Output-Determinacy and Asynchronous Circuit Synthesis.
ACSD 2007: 147-156 |
| 91 | EE | Gerald Lüttgen,
Walter Vogler:
Ready Simulation for Concurrency: It's Logical!
ICALP 2007: 752-763 |
| 90 | EE | Walter Vogler,
Ben Kangsah:
Improved Decomposition of Signal Transition Graphs.
Fundam. Inform. 78(1): 161-197 (2007) |
| 89 | EE | Arend Rensink,
Walter Vogler:
Fair testing.
Inf. Comput. 205(2): 125-198 (2007) |
| 88 | EE | Flavio Corradini,
Walter Vogler:
Performance of pipelined asynchronous systems.
J. Log. Algebr. Program. 70(2): 201-221 (2007) |
| 87 | EE | Gerald Lüttgen,
Walter Vogler:
Conjunction on processes: Full abstraction via ready-tree semantics.
Theor. Comput. Sci. 373(1-2): 19-40 (2007) |
| 86 | EE | Mark Schäfer,
Walter Vogler:
Component refinement and CSC-solving for STG decomposition.
Theor. Comput. Sci. 388(1-3): 243-266 (2007) |
| 2006 |
|---|
| 85 | EE | Mark Schäfer,
Walter Vogler,
Ralf Wollowski,
Victor Khomenko:
Strategies for Optimised STG Decomposition.
ACSD 2006: 123-132 |
| 84 | EE | Flavio Corradini,
Maria Rita Di Berardini,
Walter Vogler:
Checking a Mutex Algorithm in a Process Algebra with Fairness.
CONCUR 2006: 142-157 |
| 83 | EE | Gerald Lüttgen,
Walter Vogler:
Conjunction on Processes: Full-Abstraction Via Ready-Tree Semantics.
FoSSaCS 2006: 261-276 |
| 82 | EE | Marcos E. Kurbán,
Peter Niebert,
Hongyang Qu,
Walter Vogler:
Stronger Reduction Criteria for Local First Search.
ICTAC 2006: 108-122 |
| 81 | EE | Flavio Corradini,
Maria Rita Di Berardini,
Walter Vogler:
Fairness of Actions in System Computations.
Acta Inf. 43(2): 73-130 (2006) |
| 80 | EE | Victor Khomenko,
Alex Kondratyev,
Maciej Koutny,
Walter Vogler:
Merged processes: a new condensed representation of Petri net behaviour.
Acta Inf. 43(5): 307-330 (2006) |
| 79 | EE | Flavio Corradini,
Maria Rita Di Berardini,
Walter Vogler:
Fairness of components in system computations.
Theor. Comput. Sci. 356(3): 291-324 (2006) |
| 78 | EE | Gerald Lüttgen,
Walter Vogler:
Bisimulation on speed: A unified approach.
Theor. Comput. Sci. 360(1-3): 209-227 (2006) |
| 2005 |
|---|
| 77 | EE | Walter Vogler,
Ben Kangsah:
Improved Decomposition of STGs.
ACSD 2005: 244-253 |
| 76 | EE | Victor Khomenko,
Alex Kondratyev,
Maciej Koutny,
Walter Vogler:
Merged Processes - A New Condensed Representation of Petri Net Behaviour.
CONCUR 2005: 338-352 |
| 75 | EE | Flavio Corradini,
Walter Vogler:
Performance of Pipelined Asynchronous Systems.
FORMATS 2005: 242-257 |
| 74 | EE | Mark Schäfer,
Walter Vogler:
Component Refinement and CSC Solving for STG Decomposition.
FoSSaCS 2005: 348-363 |
| 73 | EE | Gerald Lüttgen,
Walter Vogler:
Bisimulation on Speed: A Unified Approach.
FoSSaCS 2005: 79-94 |
| 72 | EE | Mark Schäfer,
Walter Vogler,
Petr Jancar:
Determinate STG Decomposition of Marked Graphs.
ICATPN 2005: 365-384 |
| 71 | EE | Flavio Corradini,
Maria Rita Di Berardini,
Walter Vogler:
Fairness of Components in System Computations.
Electr. Notes Theor. Comput. Sci. 128(2): 35-52 (2005) |
| 70 | EE | Flavio Corradini,
Walter Vogler:
Measuring the performance of asynchronous systems with PAFAS.
Theor. Comput. Sci. 335(2-3): 187-213 (2005) |
| 2004 |
|---|
| 69 | EE | Gerald Lüttgen,
Walter Vogler:
Bisimulation on Speed: Lower Time Bounds.
FoSSaCS 2004: 333-347 |
| 68 | EE | Elmar Bihler,
Walter Vogler:
Timed Petri Nets: Efficiency of Asynchronous Systems.
SFM 2004: 25-58 |
| 67 | EE | Gerald Lüttgen,
Walter Vogler:
Bisimulation on speed: worst-case efficiency.
Inf. Comput. 191(2): 105-144 (2004) |
| 2003 |
|---|
| 66 | EE | Flavio Corradini,
Maria Rita Di Berardini,
Walter Vogler:
Relating Fairness and Timing in Process Algebras.
CONCUR 2003: 438-452 |
| 65 | EE | Victor Khomenko,
Maciej Koutny,
Walter Vogler:
Canonical prefixes of Petri net unfoldings.
Acta Inf. 40(2): 95-118 (2003) |
| 64 | EE | Walter Vogler:
Faster asynchronous systems.
Inf. Comput. 184(2): 311-342 (2003) |
| 2002 |
|---|
| 63 | EE | Victor Khomenko,
Maciej Koutny,
Walter Vogler:
Canonical Prefixes of Petri Net Unfoldings.
CAV 2002: 582-595 |
| 62 | EE | Walter Vogler,
Ralf Wollowski:
Decomposition in Asynchronous Circuit Design.
Concurrency and Hardware Design 2002: 152-190 |
| 61 | EE | Walter Vogler,
Ralf Wollowski:
Decomposition in Asynchronous Circuit Design.
FSTTCS 2002: 336-347 |
| 60 | EE | Flavio Corradini,
Walter Vogler,
Lars Jenner:
Comparing the worst-case efficiency of asynchronous systems with PAFAS.
Acta Inf. 38(11/12): 735-792 (2002) |
| 59 | | Javier Esparza,
Stefan Römer,
Walter Vogler:
An Improvement of McMillan's Unfolding Algorithm.
Formal Methods in System Design 20(3): 285-310 (2002) |
| 58 | EE | Walter Vogler:
Efficiency of asynchronous systems, read arcs, and the MUTEX-problem.
Theor. Comput. Sci. 275(1-2): 589-631 (2002) |
| 57 | EE | Walter Vogler:
Partial order semantics and read arcs.
Theor. Comput. Sci. 286(1): 33-63 (2002) |
| 2001 |
|---|
| 56 | EE | Flavio Corradini,
Maria Rita Di Berardini,
Walter Vogler:
PAFAS at Work: Comparing the Worst-Case Efficiency of Three Buffer Implementations.
APAQS 2001: 231-240 |
| 55 | EE | Gerald Lüttgen,
Walter Vogler:
A Faster-than Relation for Asynchronous Processes.
CONCUR 2001: 262-276 |
| 54 | EE | Walter Vogler:
Partial S-Invariants for the Verification of Infinite Systems Families.
ICATPN 2001: 382-402 |
| 53 | EE | Flavio Corradini,
Walter Vogler:
Preface.
Electr. Notes Theor. Comput. Sci. 52(3): (2001) |
| 52 | EE | Lars Jenner,
Walter Vogler:
Fast asynchronous systems in dense time.
Theor. Comput. Sci. 254(1-2): 379-422 (2001) |
| 2000 |
|---|
| 51 | EE | Walter Vogler:
Efficiency of Asynchronous Systems That Communicate Asynchronously.
ICATPN 2000: 424-444 |
| 50 | EE | Walter Vogler,
Lars Jenner:
Axiomatizing a Fragment of PAFAS.
Electr. Notes Theor. Comput. Sci. 39(3): (2000) |
| 1999 |
|---|
| 49 | EE | Lars Jenner,
Walter Vogler:
Comparing the Efficiency of Asynchronous Systems.
ARTS 1999: 172-191 |
| 48 | EE | Walter Vogler:
Concurrent Implementation of Asynchronous Transition Systems.
ICATPN 1999: 284-303 |
| 1998 |
|---|
| 47 | EE | Walter Vogler,
Alexei L. Semenov,
Alexandre Yakovlev:
Unfolding and Finite Prefix for Nets with Read Arcs.
CONCUR 1998: 501-516 |
| 46 | EE | Elmar Bihler,
Walter Vogler:
Efficiency of Token-Passing MUTEX-Solutions - Some Experiments.
ICATPN 1998: 185-204 |
| 1997 |
|---|
| 45 | EE | Walter Vogler:
A Short STory on Action Refinement.
Foundations of Computer Science: Potential - Theory - Cognition 1997: 271-278 |
| 44 | | Walter Vogler:
Efficiency of Asynchronous Systems and Read Arcs in Petri Nets.
ICALP 1997: 538-548 |
| 43 | | Walter Vogler:
Partial Order Semantics and Read Arcs.
MFCS 1997: 508-517 |
| 1996 |
|---|
| 42 | | Ed Brinksma,
Arend Rensink,
Walter Vogler:
Applications of Fair Testing.
FORTE 1996: 145-160 |
| 41 | | Lars Jenner,
Walter Vogler:
Fast Asynchronous Systems in Dense Time.
ICALP 1996: 75-86 |
| 40 | | Javier Esparza,
Stefan Römer,
Walter Vogler:
An Improvement of McMillan's Unfolding Algorithm.
TACAS 1996: 87-106 |
| 39 | | Walter Vogler:
The Limit of Splitn-Language Equivalence.
Inf. Comput. 127(1): 41-61 (1996) |
| 1995 |
|---|
| 38 | | Walter Vogler:
Faster Asynchronous Systems.
CONCUR 1995: 299-312 |
| 37 | | Ed Brinksma,
Arend Rensink,
Walter Vogler:
Fair Testing.
CONCUR 1995: 313-327 |
| 36 | | Walter Vogler:
The Limit of Split_n-Language Equivalence.
ICALP 1995: 636-647 |
| 35 | | Walter Vogler:
Generalized OM-Bisimulation
Inf. Comput. 118(1): 38-47 (1995) |
| 34 | | Walter Vogler:
Timed Testing of Concurrent Systems
Inf. Comput. 121(2): 149-171 (1995) |
| 33 | EE | Walter Vogler:
Fairness and Partial Order Semantics.
Inf. Process. Lett. 55(1): 33-39 (1995) |
| 1993 |
|---|
| 32 | | Walter Vogler:
Timed Testing of Concurrent Systems.
ICALP 1993: 532-543 |
| 31 | EE | Walter Vogler:
On Hyperedge Replacement and BNLC Graph Grammars.
Discrete Applied Mathematics 46(3): 253-273 (1993) |
| 30 | | Walter Vogler:
Bisimulation and Action Refinement.
Theor. Comput. Sci. 114(1): 173-200 (1993) |
| 1992 |
|---|
| 29 | | Walter Vogler:
Modular Construction and Partial Order Semantics of Petri Nets
Springer 1992 |
| 28 | | Walter Vogler:
Partial words versus processes: a short comparison.
Advances in Petri Nets: The DEMON Project 1992: 292-303 |
| 27 | | Walter Vogler:
Asynchronous Communication of Petri Nets and the Refinement of Transitions.
ICALP 1992: 605-616 |
| 26 | | Robert Gold,
Walter Vogler:
Quality criteria for partial order semantics of place/transition-nets with capacities.
Fundam. Inform. 17(3): 187-209 (1992) |
| 1991 |
|---|
| 25 | | Walter Vogler:
Deciding History Preserving Bisimilarity.
ICALP 1991: 495-505 |
| 24 | | Walter Vogler:
Bisimulation and Action Refinement.
STACS 1991: 309-321 |
| 23 | | Walter Vogler:
Failures Semantics Based on Interval Semiwords is a Congruence for Refinement.
Distributed Computing 4: 139-162 (1991) |
| 22 | | Walter Vogler:
A generalization of traces.
ITA 25: 147-156 (1991) |
| 21 | | 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) |
| 20 | | Walter Vogler:
Executions: A New Partial-Order Semantics of Petri Nets.
Theor. Comput. Sci. 91(2): 205-238 (1991) |
| 1990 |
|---|
| 19 | | Walter Vogler:
Recognizing Edge Replacement Graph Languages in Cubic Time.
Graph-Grammars and Their Application to Computer Science 1990: 676-687 |
| 18 | | Robert Gold,
Walter Vogler:
Quality Criteria for Partial Order Semantics of Place/Transition-Nets.
MFCS 1990: 306-312 |
| 17 | | Walter Vogler:
Failures Semantics Based on Interval Semiwords is a Congruence for Refinement.
STACS 1990: 285-297 |
| 1989 |
|---|
| 16 | | 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 |
| 15 | | Annegret Habel,
Hans-Jörg Kreowski,
Walter Vogler:
Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammar.
TAPSOFT, Vol.1 1989: 275-289 |
| 14 | | Walter Vogler:
On Hyperedge Replacement and BNLC Graph Grammars.
WG 1989: 78-93 |
| 13 | | Walter Vogler:
Failures Semantics and Deadlocking of Modular Petri Nets.
Acta Inf. 26(4): 333-348 (1989) |
| 12 | | Annegret Habel,
Hans-Jörg Kreowski,
Walter Vogler:
Metatheorems for Decision Problems on Hyperedge Replacement Graph Languages.
Acta Inf. 26(7): 657-677 (1989) |
| 11 | | Dirk Taubner,
Walter Vogler:
Step Failures Semantics and a Complete Proof System.
Acta Inf. 27(2): 125-156 (1989) |
| 10 | | Volker Diekert,
Walter Vogler:
On the Synchronization of Traces.
Mathematical Systems Theory 22(3): 161-175 (1989) |
| 1988 |
|---|
| 9 | | Walter Vogler:
Representation of a swapping class by one net.
European Workshop on Applications and Theory in Petri Nets 1988: 467-486 |
| 8 | | Volker Diekert,
Walter Vogler:
Local Checking of Trace Synchroniziability.
MFCS 1988: 271-279 |
| 7 | | Walter Vogler:
Failures Semantics and Deadlocking of Modular Petri Nets.
MFCS 1988: 542-551 |
| 1987 |
|---|
| 6 | | Dirk Taubner,
Walter Vogler:
The Step Failure Semantics.
STACS 1987: 348-359 |
| 5 | | Walter Vogler:
An Improved Multiple Identification Algorithm for Synchronous Broadcasting Networks.
WDAG 1987: 84-91 |
| 4 | | Annegret Habel,
Hans-Jörg Kreowski,
Walter Vogler:
Complativle graph properties are decidable for hypergraph replacement graph languages.
Bulletin of the EATCS 33: 55-61 (1987) |
| 1986 |
|---|
| 3 | | Walter Vogler:
Behaviour Preserving Refinement of Petri Nets.
WG 1986: 82-93 |
| 2 | EE | Walter Vogler:
Representing abstract groups by powers of a graph.
J. Comb. Theory, Ser. B 40(1): 81-93 (1986) |
| 1985 |
|---|
| 1 | | Reinhard Diestel,
Rudolf Halin,
Walter Vogler:
Some remarks on universal graphs.
Combinatorica 5(4): 283-293 (1985) |
