2008 |
28 | EE | Harald Fecher,
Michael Huth,
Nir Piterman,
Daniel Wagner:
Hintikka Games for PCTL on Labeled Markov Chains.
QEST 2008: 169-178 |
27 | EE | Harald Fecher,
Sharon Shoham:
State Focusing: Lazy Abstraction for the Mu-Calculus.
SPIN 2008: 95-113 |
26 | EE | Harald Fecher,
Michael Huth:
Model Checking for Action Abstraction.
VMCAI 2008: 112-126 |
25 | EE | Harald Fecher,
Heiko Schmidt:
Comparing disjunctive modal transition systems with an one-selecting variant.
J. Log. Algebr. Program. 77(1-2): 20-39 (2008) |
2007 |
24 | EE | Harald Fecher,
Immo Grabe:
Finite Abstract Models for Deterministic Transition Systems: Fair Parallel Composition and Refinement-Preserving Logic.
FSEN 2007: 1-16 |
23 | EE | Harald Fecher,
Sharon Shoham:
Local Abstraction-Refinement for the mu-Calculus.
SPIN 2007: 4-23 |
22 | EE | Harald Fecher,
Michael Huth:
More Precise Partition Abstractions.
VMCAI 2007: 167-181 |
21 | EE | Harald Fecher,
Heiko Schmidt:
Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems.
Electr. Notes Theor. Comput. Sci. 192(1): 45-60 (2007) |
2006 |
20 | EE | Harald Fecher,
Michael Huth:
Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise.
ATVA 2006: 322-336 |
19 | EE | Harald Fecher,
Jens Schönborn:
UML 2.0 State Machines: Complete Formal Semantics Via core state machine.
FMICS/PDMC 2006: 244-260 |
18 | EE | Harald Fecher,
Martin Leucker,
Verena Wolf:
Don't Know in Probabilistic Systems.
SPIN 2006: 71-88 |
17 | EE | Harald Fecher,
Marcel Kyas,
Willem P. de Roever,
Frank S. de Boer:
Compositional Operational Semantics of a UML-Kernel-Model Language.
Electr. Notes Theor. Comput. Sci. 156(1): 79-96 (2006) |
16 | EE | Harald Fecher,
Mila E. Majster-Cederbaum:
Action Refinement Applied to Late Decisions.
Formal Asp. Comput. 18(2): 211-230 (2006) |
2005 |
15 | EE | Harald Fecher,
Jens Schönborn,
Marcel Kyas,
Willem P. de Roever:
29 New Unclarities in the Semantics of UML 2.0 State Machines.
ICFEM 2005: 52-65 |
14 | EE | Marcel Kyas,
Harald Fecher,
Frank S. de Boer,
Joost Jacob,
Jozef Hooman,
Mark van der Zwaag,
Tamarah Arons,
Hillel Kugler:
Formalizing UML Models and OCL Constraints in PVS.
Electr. Notes Theor. Comput. Sci. 115: 39-47 (2005) |
13 | EE | Harald Fecher,
Martin Steffen:
Characteristic mu-Calculus Formulas for Underspecified Transition Systems.
Electr. Notes Theor. Comput. Sci. 128(2): 103-116 (2005) |
12 | EE | Harald Fecher:
Truly Concurrent Logic via In-Between Specification.
Electr. Notes Theor. Comput. Sci. 128(6): 215-230 (2005) |
11 | EE | Harald Fecher,
Mila E. Majster-Cederbaum:
Event Structures for Arbitrary Disruption.
Fundam. Inform. 68(1-2): 103-130 (2005) |
2004 |
10 | EE | Harald Fecher:
The Influence of Durational Actions on Time Equivalences.
FORMATS/FTRTFT 2004: 231-245 |
9 | EE | Harald Fecher:
Event Structures for Interrupt Process Algebras.
Electr. Notes Theor. Comput. Sci. 96: 113-127 (2004) |
8 | EE | Harald Fecher:
A completed hierarchy of true concurrent equivalences.
Inf. Process. Lett. 89(5): 261-265 (2004) |
7 | EE | Jinzhao Wu,
Harald Fecher:
Symmetric Structure in Logic Programming.
J. Comput. Sci. Technol. 19(6): 803-811 (2004) |
2003 |
6 | EE | Mila E. Majster-Cederbaum,
Naijun Zhan,
Harald Fecher:
Action Refinement from a Logical Point of View.
VMCAI 2003: 253-267 |
2002 |
5 | EE | Harald Fecher,
Mila E. Majster-Cederbaum,
Jinzhao Wu:
Action Refinement for Probabilistic Processes with True Concurrency Models.
PAPM-PROBMIV 2002: 77-94 |
4 | EE | Harald Fecher,
Mila E. Majster-Cederbaum,
Jinzhao Wu:
Refinement of actions in a real-time process algebra with a true concurrency model.
Electr. Notes Theor. Comput. Sci. 70(3): (2002) |
3 | EE | Harald Fecher,
Mila E. Majster-Cederbaum:
Taking decisions late: end-based choice combined with action refinement.
Electr. Notes Theor. Comput. Sci. 70(3): (2002) |
2 | EE | Harald Fecher,
Mila E. Majster-Cederbaum,
Jinzhao Wu:
Bundle event structures: A revised cpo approach.
Inf. Process. Lett. 83(1): 7-12 (2002) |
2001 |
1 | EE | Harald Fecher:
A Real-Time Process Algebra with Open Intervals and Maximal Progress.
Nord. J. Comput. 8(3): 346-365 (2001) |