|
32
|
Partial Commutation and Traces
– Volker Diekert, Yves Métivier
- 1997
|
|
31
|
Logical Definability on Infinite Traces
– Werner Ebinger, Anca Muscholl
- 1993
|
|
1
|
On the complementation of asynchronous cellular Büchi automata
– Anca Muscholl
- 1996
|
|
1
|
On Efficient Reduction-Algorithms for Some Trace Rewriting Systems
– Michael Bertol, Volker Diekert
- 1993
|
|
1
|
Confluence Problems for Trace Rewriting Systems
– Markus Lohrey
- 2001
|
|
1
|
A Domain for Concurrent Termination: A Generalization of Mazurkiewicz traces
– Volker Diekert, Paul Gastin
- 1994
|
|
1
|
On the confluence of trace rewriting systems
– Markus Lohrey
- 1998
|
|
2
|
Assumption-Commitment in Automata
– Swarup Mohalik, R. Ramanujam
- 1997
|
|
4
|
Keeping Track of the Latest Gossip in a Distributed System
– Madhavan Mukund, Milind Sohoni
- 1997
|
|
3
|
Gossiping, Asynchronous Automata and Zielonka's Theorem
– Madhavan Mukund, Milind Sohoni
- 1994
|
|
1
|
Determinizing Asynchronous Automata on Infinite Inputs
– Nils Klarlund, Nils Klarlund, Madhavan Mukund, Madhavan Mukund, Milind Sohoni, Milind Sohoni
- 1995
|
|
2
|
Code Problems on Traces
– Volker Diekert, Anca Muscholl
- 1996
|
|
3
|
Efficient Rewriting in Cograph Trace Monoids
– Michael Bertol
- 1995
|
|
|
Kleene Coalgebra – an overview
– Ra Silva, Marcello Bonsangue, Jan Rutten, Centrum Wiskunde
|
|
1
|
A Hierarchy of Partial Order Temporal Properties
– Marta Kwiatkowska, Doron Peled, Wojciech Penczek
- 1994
|
|
|
May 2006Distributed Muller Automata and Logics
– Benedikt Bollig, Dietrich Kuske
|
|
1
|
Muller Message-Passing Automata and Logics
– Benedikt Bollig, Dietrich Kuske
|
|
|
Well-Quasi-Orders and Regular ω-languages
– Mizuhito Ogawa
- 2000
|
|
|
Regularity for ω-Languages Based on Well-Quasi-Orders
– Mizuhito Ogawa
- 1997
|
