2014

Decomposing Balsa-STGs (Working Notes)

Stanislavs Golubcovs, Walter Vogler
Technical Report, Institute of Computer Science, University of Augsburg, April 2014
2014-01

 

 

2013

STG-Based Resynthesis for Balsa Circuits

Stanislavs Golubcovs, Walter Vogler, Norman Kluge
Technical Report, Institute of Computer Science, University of Augsburg, November 2013
2013-12

 

 

2012

Interface-Automata with Error States

F. Bujtor, W. Vogler
Technical Report, 2012
2012-09

 

 

2009

Robustness of a bisimulation-type faster-than relation

K.Iltgen, W.Vogler
Technical Report, 2009
2009-08

 

 

2008

Safe Reasoning with Logic LTS

Gerald Lüttgen and Walter Vogler
Technical Report, Institute of Computer Science, University of Augsburg, 2008
2008-18

 

Time and Fairness in a Process Algebra with Non-Blocking Reading

F. Corradini, M.R. Di Berardini, W. Vogler
Technical Report, Institute of Computer Science, University of Augsburg, 2008
2008-13

 

Liveness of a Mutex Algorithm in a Fair Process Algebra
F. Corradini, M.R. Di Berardini, W. Vogler
Technical Report, Institute of Computer Science, University of Augsburg, 2008
2008-03

 

Avoiding Irreducible CSC Conflicts by Internal Communication

Mark Schaefer, Walter Vogler, Dominic Wist and Ralf Wollowski
Technical Report, Institute of Computer Science, University of Augsburg, February 2008
2008-02

 

 

2007

DesiJ - A Tool for STG Decomposition

Mark Schaefer
Technical Report, Institute of Computer Science, University of Augsburg, October 2007
2007-11

 

Ready Simulation for Concurrency: It's Logical!

Gerald Lüttgen and Walter Vogler
Technical Report, Institute of Computer Science, University of Augsburg, 2007
2007-04

 

Output-Determinacy and Asynchronous Circuit Synthesis

Victor Khomenko, Mark Schaefer and Walter Vogler
Technical Report, Institute of Computer Science, University of Augsburg, January 2007
2007-02

 

Combining Decomposition and Unfolding for STG Synthesis

Victor Khomenko and Mark Schaefer
Technical Report, Institute of Computer Science, University of Augsburg, January 2007
2007-01

 

 

2005

Fair Testing
A. Rensink, W. Vogler
Center for Telematics and Information Technology, Univ. of Twente,CTIT Technical Report 05-64

 

Conjunction on Processes: Ready-Tree Semantics
G. Lüttgen, W. Vogler
Department of Computer Science, University of York, Report YCS 396, 2005

 

STG Decomposition: Optimised Backtracking and Component Reduction

Mark Schaefer
Technical Report, Institute of Computer Science, University of Augsburg, 2005
2005-13

 

Fairness of Components in System Computations

F. Corradini, M.R. Di Berardini, W. Vogler
Technical Report, Institute of Computer Science, University of Augsburg, 2005
2005-03

 

Fairness of Actions in System Computations

F. Corradini, M.R. Di Berardini, W. Vogler
Technical Report, Institute of Computer Science, University of Augsburg, 2005
2005-02

 

 

2004

Bisimulation on Speed: A Unified Approach

Gerald Lüttgen, Walter Vogler
Technical Report, Institute of Computer Science, University of Augsburg, 2004
2004-15

 

Component Refinement and CSC Solving for STG Decomposition

Mark Schaefer, Walter Vogler
Technical Report, Institute of Computer Science, University of Augsburg, 2004
2004-13

 

Determinate STG Decomposition of Marked Graphs

Mark Schaefer, Walter Vogler
Technical Report, Institute of Computer Science, University of Augsburg, 2004
2004-12

 

Improved Decomposition of Signal Transition Graphs

Walter Vogler, Ben Kangsah
Technical Report, Institute of Computer Science, University of Augsburg, 2004
2004-08

 

Bisimulation on Speed: Lower Time Bounds

Gerald Lüttgen, Walter Vogler
Technical Report, Institute of Computer Science, University of Augsburg, 2004
2004-01

 

 

2002

Decomposition in Asynchronous Circuit Design

W. Vogler, R. Wollowski
Technical Report, Institute of Computer Science, University of Augsburg, 2002
2002-05

 

Measuring the Performance of Asynchronous Systems with PAFAS

F. Corradini, W. Vogler
Technical Report, Institute of Computer Science, University of Augsburg, 2002
2002-04

 

 

2001

Partial S-Invariants for the Verification of Infinite Systems Families

Walter Vogler
Technical Report, Institute of Computer Science, University of Augsburg, 2001
2001-04

 

 

2000

Comparing the Worst-Case Efficiency of Asynchronous Systems with PAFAS

Flavio Corradini, Walter Vogler, Lars Jenner
Technical Report, Institute of Computer Science, University of Augsburg, 2000
2000-06

 

Objektorientiertes Design eines Werkzeugs zum Effizienzvergleich asynchroner Systeme

Elmar Bihler
Technical Report, Institute of Computer Science, University of Augsburg, 2000
2000-02

 

Axiomatizing a Fragment of PAFAS

Walter Vogler, Lars Jenner
Technical Report, Institute of Computer Science, University of Augsburg, 2000
2000-01

 

 

1999

Efficiency of Asynchronous Systems That Communicate Asynchronously

Walter Vogler
Technical Report, Institute of Computer Science, University of Augsburg, 1999
1999-06

 

 

1998

Concurrent Implementation of Asynchronous Transition Systems

Walter Vogler
Technical Report, Institute of Computer Science, University of Augsburg, 1998
1998-05

 

Further Studies on Timed Testing of Concurrent Systems

Lars Jenner
Technical Report, Institute of Computer Science, University of Augsburg, 1998
1998-04

 

Comparing the Efficiency of Asynchronous Systems

Lars Jenner, Walter Vogler
Technical Report, Institute of Computer Science, University of Augsburg, 1998
1998-03

 

 

1997

Partial Order Semantics and Read Arcs

Walter Vogler
Technical Report, Institute of Computer Science, University of Augsburg, 1997
1997-01

 

 

1996

Modular Construction of Fast Asynchronous Systems

Lars Jenner
Technical Report, Institute of Computer Science, University of Augsburg, 1996
1996-02