The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Walter Vogler: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  91. Avoiding irreducible CSC conflicts by internal communication. [Citation Graph (, )][DBLP]


  92. Safe Reasoning with Logic LTS. [Citation Graph (, )][DBLP]


  93. Time and Fairness in a Process Algebra with Non-blocking Reading. [Citation Graph (, )][DBLP]


  94. Liveness of a mutex algorithm in a fair process algebra. [Citation Graph (, )][DBLP]


  95. STG decomposition strategies in combination with unfolding. [Citation Graph (, )][DBLP]


  96. Robustness of a bisimulation-type faster-than preorder [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.013secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002