| [1] |
Harald Fecher, Michael Huth, Nir Piterman, and Daniel Wagner.
Hintikka games for pctl on labeled markov chains.
In QEST, 2008.
accepted for publication. [ bib | .pdf ] |
| [2] |
Harald Fecher and Sharon Shoham.
State focusing: Lazy abstraction for the mu-calculus.
In SPIN, volume 5156 of Lecture Notes in Computer
Science, pages 95-113. Springer, 2008.
Copyright hold by Springer-Verlag. [ bib | .pdf ] |
| [3] |
Harald Fecher and Michael Huth.
Model checking for action abstraction.
In VMCAI, volume 4905 of Lecture Notes in Computer
Science, pages 112-126. Springer, 2008.
Copyright hold by Springer-Verlag. [ bib | .pdf ] |
| [4] |
Harald Fecher and Heiko Schmidt.
Comparing disjunctive modal transition systems with an one-selecting
variant.
Journal of Logic and Algebraic Programming, 77:20-39, 2008.
Preliminary version:
http://www.informatik.uni-freiburg.de/ fecher/papers/Fecher07CDMTSO.pdf. [ bib | http ] |
| [5] |
Harald Fecher, Michael Huth, Heiko Schmidt, and Jens Schönborn.
Refinement sensitive formal semantics of state machines with
persistent choice.
In AVoCS, 2007. [ bib | .pdf ] |
| [6] |
Harald Fecher, Heiko Schmidt, and Jens Schönborn.
Uml state machines: Fairness conditions specify the event pool
(extended abstract).
In Nordic Workshop on Programming Theory, 2007. [ bib | .pdf ] |
| [7] |
Harald Fecher.
Applications for variants of modal transition systems, 2007.
Talk at the Copenhagen Meeting on Modal Transition Systems. [ bib | .pdf ] |
| [8] |
Harald Fecher and Sharon Shoham.
Local abstraction-refinement for the mu-calculus.
In SPIN, volume 4595 of Lecture Notes in Computer
Science, pages 4-23. Springer, 2007.
Copyright hold by Springer-Verlag. [ bib | .pdf ] |
| [9] |
Harald Fecher and Heiko Schmidt.
Process algebra having inherent choice: Revised semantics for
concurrent systems.
In SOS, volume 192 of Electr. Notes Theor. Comput. Sci.,
pages 45-60, 2007. [ bib | .pdf ] |
| [10] |
Harald Fecher and Immo Grabe.
Finite abstract models for deterministic transition systems: Fair
parallel composition and refinement-preserving logic.
In FSEN, volume 4767 of Lecture Notes in Computer
Science, pages 1-16. Springer, 2007. [ bib | .pdf ] |
| [11] |
Harald Fecher and Michael Huth.
More precise partition abstraction.
In VMCAI, volume 4349 of Lecture Notes in Computer
Science, pages 167-181. Springer, 2007.
Copyright hold by Springer-Verlag. [ bib | .pdf ] |
| [12] |
Harald Fecher and Jens Schönborn.
UML 2.0 state machines: Complete formal semantics via core state
machines.
In FMICS and PDMC, volume 4346 of Lecture Notes in
Computer Science, pages 244-260. Springer, 2006.
Copyright hold by Springer-Verlag. [ bib | .pdf ] |
| [13] |
Harald Fecher and Michael Huth.
Ranked predicate abstraction for branching time: Complete,
incremental, and precise.
In ATVA, volume 4218 of Lecture Notes in Computer
Science, pages 322-336. Springer, 2006.
Copyright hold by Springer-Verlag. [ bib | .pdf ] |
| [14] |
Harald Fecher and Mila Majster-Cederbaum.
Action refinement applied to late decisions.
Formal Aspects of Computing, 18(2):211-230, 2006.
The original publication is available at www.springerlink.com. [ bib | .pdf ] |
| [15] |
Harald Fecher, Martin Leucker, and Verena Wolf.
Don't know in probabilistic systems.
In SPIN, volume 3925 of Lecture Notes in Computer
Science, pages 71-88. Springer, 2006.
Copyright hold by Springer-Verlag. [ bib | .pdf ] |
| [16] |
Harald Fecher, Marcel Kyas, Willem-Paul de Roever, and Frank S. de Boer.
Compositional operational semantics of a UML-kernel-model language.
In SOS'05, volume 156 of Electronic Notes in Theoretical
Computer Science, pages 79-96. Elsevier Science Publishers, 2006. [ bib | .pdf ] |
| [17] |
Harald Fecher and Michael Huth.
Complete abstraction through extensions of disjunctive modal
transition systems.
Technical Report 0604, Christian-Albrechts-Universität zu Kiel,
2006. [ bib | .pdf ] |
| [18] |
Harald Fecher and Mila Majster-Cederbaum.
Event structures for arbitrary disruption.
Fundamenta Informaticae, 68(1,2):103-130, 2005. [ bib | .pdf ] |
| [19] |
Harald Fecher, Jens Schönborn, Marcel Kyas, and Willem P. de Roever.
29 new unclarities in the semantics of UML 2.0 state machines.
In ICFEM, volume 3785 of Lecture Notes in Computer
Science, pages 52-65. Springer, 2005.
Copyright hold by Springer-Verlag. [ bib | .pdf ] |
| [20] |
Harald Fecher, Marcel Kyas, and Jens Schönborn.
Semantic issues in UML 2.0 state machines.
Technical Report 0507, Christian-Albrechts-Universität zu Kiel,
2005. [ bib | .pdf ] |
| [21] |
Harald Fecher.
True concurrent logic via in-between specification.
In AVoCS'04, volume 128 (6) of Electronic Notes in
Theoretical Computer Science, pages 215-230. Elsevier Science Publishers,
2005. [ bib | .pdf ] |
| [22] |
Marcel Kyas, Harald Fecher, Frank S. de Boer, Joost Jacob, Jozef Hooman, Mark
van der Zwaag, Tamarah Arons, and Hillel Kugler.
Formalizing UML models and OCL constraints in PVS.
In SFEDL'04, volume 115 of Electronic Notes in Theoretical
Computer Science, pages 39-47. Elsevier Science Publishers, 2005. [ bib | .pdf ] |
| [23] |
Harald Fecher and Martin Steffen.
Characteristic mu-calculus formula for an underspecified
transition system.
In EXPRESS'04, volume 128 of Electronic Notes in
Theoretical Computer Science, pages 103-116. Elsevier Science Publishers,
2005. [ bib | .pdf ] |
| [24] |
Harald Fecher.
The influences of durational actions on time equivalences.
In FORMATS and FTRTFT'04, volume 3253 of Lecture Notes in
Computer Science, pages 231-245. Springer-Verlag, 2004.
Copyright hold by Springer-Verlag. [ bib | .pdf ] |
| [25] |
Harald Fecher.
A completed hierarchy of true concurrent equivalences.
Information Processing Letters, 89(5):261-265, 2004. [ bib | .ps ] |
| [26] |
Harald Fecher.
Event structures for interrupt process algebras.
In EXPRESS'03, volume 96 of Electronic Notes in
Theoretical Computer Science, pages 113-127. Elsevier Science Publishers,
2004. [ bib | .pdf ] |
| [27] |
Harald Fecher.
Action Refinement in End-Based Choice Settings.
PhD thesis, Universität Mannheim, 2003.
Phd-thesis. [ bib | .pdf ] |
| [28] |
Mila Majster-Cederbaum, Naijun Zhan, and Harald Fecher.
Action refinement from a logical point of view.
In L. Zuck, P. Attie, A. Cortesi, and S. Mukhopadhyay, editors,
VMCAI, volume 2575 of Lecture Notes in Computer Science, pages
253-267. Springer-Verlag, 2003.
contains some technical mistakes. [ bib ] |
| [29] |
Harald Fecher and Mila Majster-Cederbaum.
Taking decisions late: End-based choice combined with action
refinement.
In REFINE'02, volume 70 of Electronic Notes in Theoretical
Computer Science. Elsevier Science Publishers, 2002. [ bib | .ps ] |
| [30] |
Harald Fecher, Mila Majster-Cederbaum, and Jinzhao Wu.
Refinement of actions in a real-time process algebra with a true
concurrency model.
In REFINE'02, volume 70 of Electronic Notes in Theoretical
Computer Science. Elsevier Science Publishers, 2002. [ bib | .ps ] |
| [31] |
Harald Fecher, Mila Majster-Cederbaum, and Jinzhao Wu.
Action refinement for probabilistic processes with true concurrency
models.
In PAPM-PROBMIV, volume 2399 of Lecture Notes in Computer
Science, pages 77-94. Springer-Verlag, 2002.
Copyright hold by Springer-Verlag. [ bib | .pdf ] |
| [32] |
Harald Fecher, Mila Majster-Cederbaum, and Jinzhao Wu.
Bundle event structures: A revised CPO approach.
Information Processing Letters, 83(1):7-12, 2002. [ bib | .ps ] |
| [33] |
Harald Fecher.
A real-time process algebra with open intervals and maximal progress.
Nordic Journal of Computing, 8(3):346-365, 2001. [ bib | .ps ] |
| [34] |
Harald Fecher.
Denotational semantics of untyped object-based programming languages,
1999.
masterthesis. [ bib | .ps ] |