Search the dblp DataBase
Harald Fecher :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Harald Fecher , Michael Huth Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise. [Citation Graph (0, 0)][DBLP ] ATVA, 2006, pp:322-336 [Conf ] Harald Fecher The Influence of Durational Actions on Time Equivalences. [Citation Graph (0, 0)][DBLP ] FORMATS/FTRTFT, 2004, pp:231-245 [Conf ] Harald Fecher , Jens Schönborn , Marcel Kyas , Willem P. de Roever 29 New Unclarities in the Semantics of UML 2.0 State Machines. [Citation Graph (0, 0)][DBLP ] ICFEM, 2005, pp:52-65 [Conf ] Harald Fecher , Mila E. Majster-Cederbaum , Jinzhao Wu Action Refinement for Probabilistic Processes with True Concurrency Models. [Citation Graph (0, 0)][DBLP ] PAPM-PROBMIV, 2002, pp:77-94 [Conf ] Harald Fecher , Martin Leucker , Verena Wolf Don't Know in Probabilistic Systems. [Citation Graph (0, 0)][DBLP ] SPIN, 2006, pp:71-88 [Conf ] Mila E. Majster-Cederbaum , Naijun Zhan , Harald Fecher Action Refinement from a Logical Point of View. [Citation Graph (0, 0)][DBLP ] VMCAI, 2003, pp:253-267 [Conf ] Harald Fecher Event Structures for Interrupt Process Algebras. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2004, v:96, n:, pp:113-127 [Journal ] Harald Fecher Truly Concurrent Logic via In-Between Specification. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2005, v:128, n:6, pp:215-230 [Journal ] Harald Fecher , Marcel Kyas , Willem P. de Roever , Frank S. de Boer Compositional Operational Semantics of a UML-Kernel-Model Language. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2006, v:156, n:1, pp:79-96 [Journal ] Harald Fecher , Mila E. Majster-Cederbaum Taking decisions late: end-based choice combined with action refinement. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2002, v:70, n:3, pp:- [Journal ] Harald Fecher , Mila E. Majster-Cederbaum , Jinzhao Wu Refinement of actions in a real-time process algebra with a true concurrency model. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2002, v:70, n:3, pp:- [Journal ] Harald Fecher , Martin Steffen Characteristic mu-Calculus Formulas for Underspecified Transition Systems. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2005, v:128, n:2, pp:103-116 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2005, v:115, n:, pp:39-47 [Journal ] Harald Fecher , Mila E. Majster-Cederbaum Action Refinement Applied to Late Decisions. [Citation Graph (0, 0)][DBLP ] Formal Asp. Comput., 2006, v:18, n:2, pp:211-230 [Journal ] Harald Fecher , Mila E. Majster-Cederbaum Event Structures for Arbitrary Disruption. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2005, v:68, n:1-2, pp:103-130 [Journal ] Harald Fecher A completed hierarchy of true concurrent equivalences. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2004, v:89, n:5, pp:261-265 [Journal ] Harald Fecher , Mila E. Majster-Cederbaum , Jinzhao Wu Bundle event structures: A revised cpo approach. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:83, n:1, pp:7-12 [Journal ] Jinzhao Wu , Harald Fecher Symmetric Structure in Logic Programming. [Citation Graph (0, 0)][DBLP ] J. Comput. Sci. Technol., 2004, v:19, n:6, pp:803-811 [Journal ] Harald Fecher A Real-Time Process Algebra with Open Intervals and Maximal Progress. [Citation Graph (0, 0)][DBLP ] Nord. J. Comput., 2001, v:8, n:3, pp:346-365 [Journal ] Harald Fecher , Sharon Shoham Local Abstraction-Refinement for the mu-Calculus. [Citation Graph (0, 0)][DBLP ] SPIN, 2007, pp:4-23 [Conf ] Harald Fecher , Jens Schönborn UML 2.0 State Machines: Complete Formal Semantics Via core state machine. [Citation Graph (0, 0)][DBLP ] FMICS/PDMC, 2006, pp:244-260 [Conf ] Harald Fecher , Immo Grabe Finite Abstract Models for Deterministic Transition Systems: Fair Parallel Composition and Refinement-Preserving Logic. [Citation Graph (0, 0)][DBLP ] FSEN, 2007, pp:1-16 [Conf ] Hintikka Games for PCTL on Labeled Markov Chains. [Citation Graph (, )][DBLP ] State Focusing: Lazy Abstraction for the Mu-Calculus. [Citation Graph (, )][DBLP ] More Precise Partition Abstractions. [Citation Graph (, )][DBLP ] Model Checking for Action Abstraction. [Citation Graph (, )][DBLP ] On the Expressiveness of Refinement Settings. [Citation Graph (, )][DBLP ] Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems. [Citation Graph (, )][DBLP ] Refinement Sensitive Formal Semantics of State Machines With Persistent Choice. [Citation Graph (, )][DBLP ] Search in 0.043secs, Finished in 0.045secs