Hans Fleischhack

According to our database1, Hans Fleischhack authored at least 17 papers between 1985 and 2005.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2005
Compositional Semantics for UML 2.0 Sequence Diagrams Using Petri Nets.
Proceedings of the SDL 2005: Model Driven, 2005

2003
Hierarchical Timed High Level Nets and Their Branching Processes.
Proceedings of the Applications and Theory of Petri Nets 2003, 2003

Compositional High Level Petri Nets with Timing Constraints - A Comparison.
Proceedings of the 3rd International Conference on Application of Concurrency to System Design (ACSD 2003), 2003

2002
Computing a Finite Prefix of a Time Petri Net.
Proceedings of the Applications and Theory of Petri Nets 2002, 2002

1999
Model Checking of Time Petri Nets Based on Partial Order Semantics.
Proceedings of the CONCUR '99: Concurrency Theory, 1999

1998
Towards Compositional Verification of SDL Systems.
Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences, 1998

A Compositional Petri Net Semantics for SDL.
Proceedings of the Application and Theory of Petri Nets 1998, 1998

1997
A Petri Net Semantics for B(PN)<sup>2</sup> with Procedures.
Proceedings of the International Symposium on Software Engineering for Parallel and Distributed Systems, 1997

An M-Net Semantics for a Real-Time Extension of µSDL.
Proceedings of the FME '97: Industrial Applications and Strengthened Foundations of Formal Methods, 1997

1995
An M-net Semantics of B(PN)2.
Proceedings of the International Workshop on Structures in Concurrency Theory, 1995

Computing Petri Net Languages by Reductions.
Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

A Class of Composable High Level Petri Nets with an Application to the Semantics of B(PN)<sup>2</sup>.
Proceedings of the Application and Theory of Petri Nets 1995, 1995

1992
P-Superfairness in Nets.
Proceedings of the Application and Theory of Petri Nets 1992, 1992

1987
Diagonalizations over Polynomial Time Computable Sets.
Theor. Comput. Sci., 1987

Diagonalizing over Deterministic Polynomial Time.
Proceedings of the CSL '87, 1987

1986
P-Genericity and Strong G-Genericity.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1985
On diaginalizations over complexity classes.
PhD thesis, 1985


  Loading...