Loading
Error: Cannot Load Popup Box
Skip to hit list
Adjust your hit list
Further result pages
Mobile

A
A
A

A

English
Deutsch
Français
Español
Polski
Ελληνικά
Українська
中文
 Logged in as

Log Out

Login
BASIC
SEARCH
ADVANCED
SEARCH
HELP
BROWSING
SEARCH
HISTORY
Your search
Search For:
Entire Document
Title
Author
Subject
Boost open access documents
Find
Linguistics tools
Verbatim search
Additional word forms
Multilingual synonyms
Statistics
63 hits
in 72,247,077 documents
in 0.25 seconds
Please leave the following field blank:
Home
»
Search: Henning Dierks
Hit List
Hit list
1.
Specification and Verification of Polling RealTime Systems (Extended Abstract)
Open Access
Title:
Specification and Verification of Polling RealTime Systems (Extended Abstract)
Author:
Henning Dierks
;
Henning Dierks
Henning Dierks
;
Henning Dierks
Minimize authors
Description:
Formal methods for realtime systems are an important topic of contemporary research. The aim is to cope with the additional complexity of ``time'' in specification and verification. In [Die99b] we present an approach to the correct design of realtime programs implemented on ``Programmable Logic Controllers'' (PLCs). This hardware executes repe...
Formal methods for realtime systems are an important topic of contemporary research. The aim is to cope with the additional complexity of ``time'' in specification and verification. In [Die99b] we present an approach to the correct design of realtime programs implemented on ``Programmable Logic Controllers'' (PLCs). This hardware executes repeatedly an application program whereas each cycle has an upper time bound. The central device in our approach is the notion of ``PLCAutomaton'' which provides an abstract view on PLC programs. For PLCAutomata the following results are presented in [Die99b]: It is possible to generate PLC source code from a PLCAutomaton. Also constraints on both the speed of the PLC and on the accuracy of time measurement are derived. A logical semantics in terms of Duration Calculus is developed. Since this semantics considers the cyclic behaviour, computation speed, and timer tolerances a realistic model of the realworld behaviour is given. Several ways to compose PLCAutomata are defined and described semantically. An alternative operational semantics in terms of Timed Automata is given. It is provably consistent with the Duration Calculus semantics. Hence, modelchecking PLCAutomata is possible due to this semantics. Moreover, we examine techniques for building abstractions of these Timed Automata models. A formal synthesis procedure for ``Implementables'', a sublanguage of Duration Calculus, is derived that produces a PLCAutomaton implementing the Implementablesspecification if and only if there exists an implementing PLCAutomaton.
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20090415
Source:
ftp://theoretica.Informatik.UniOldenburg.DE/pub/Papers/hd00.ps.gz
ftp://theoretica.Informatik.UniOldenburg.DE/pub/Papers/hd00.ps.gz
Minimize
Document Type:
text
Language:
en
DDC:
005 Computer programming, programs & data
(computed)
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.2917
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.2917
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
2.
for RealTime Systems y
Open Access
Title:
for RealTime Systems y
Author:
Henning Dierks Z
Henning Dierks Z
Minimize authors
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20080701
Source:
http://folli.loria.fr/cds/1998/pdf/hansen/hansen4.pdf
http://folli.loria.fr/cds/1998/pdf/hansen/hansen4.pdf
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.8264
http://folli.loria.fr/cds/1998/pdf/hansen/hansen4.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.8264
http://folli.loria.fr/cds/1998/pdf/hansen/hansen4.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
3.
Constructing Test Automata from Graphical RealTime Requirements
Open Access
Title:
Constructing Test Automata from Graphical RealTime Requirements
Author:
Henning Dierks
;
Marc Lettrari
Henning Dierks
;
Marc Lettrari
Minimize authors
Description:
A semantics for a graphical specification language of realtime properties (Constraint Diagrams) is presented. The new semantics is given in terms of Timed Automata. A model in terms of Timed Automata satisfies the property given by a Constraint Diagram if the model in parallel composition with the semantics of the Constraint Diagram can reach a...
A semantics for a graphical specification language of realtime properties (Constraint Diagrams) is presented. The new semantics is given in terms of Timed Automata. A model in terms of Timed Automata satisfies the property given by a Constraint Diagram if the model in parallel composition with the semantics of the Constraint Diagram can reach a certain state. This kind of question can be checked by all modelcheckers for Timed Automata. A prototype of a tool is presented that automatically translates an appropriate Constraint Diagram into the input language of the tool Uppaal.
Minimize
Publisher:
Springer
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20090831
Source:
http://ca.Informatik.UniOldenburg.DE/publications/let02.ps
http://ca.Informatik.UniOldenburg.DE/publications/let02.ps
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.8414
http://ca.Informatik.UniOldenburg.DE/publications/let02.ps
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.8414
http://ca.Informatik.UniOldenburg.DE/publications/let02.ps
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
4.
Heuristic Guided ModelChecking of RealTime Systems ⋆
Open Access
Title:
Heuristic Guided ModelChecking of RealTime Systems ⋆
Author:
Henning Dierks
Henning Dierks
Minimize authors
Description:
Abstract. We present an approach to modelcheck realtime systems by the costoptimising version of Uppaal. The additional features for heuristic guidance of the costoptimising version improve the performance in finding error traces. An important precondition for successful heuristics are contextual information about the system. To explain our a...
Abstract. We present an approach to modelcheck realtime systems by the costoptimising version of Uppaal. The additional features for heuristic guidance of the costoptimising version improve the performance in finding error traces. An important precondition for successful heuristics are contextual information about the system. To explain our approach we introduce a mutual exclusion problem of a realtime system specified in terms of PLCAutomata. Finding errors by modelchecking the semantics in terms of timed automata is substantially improved by heuristics guidance. Our heuristics are derived by exploiting the contextual information that the timed automata system to be checked represents the semantics of PLCAutomata. Finally we present the results of our approach applied to a nontrivial case study from an industrial project.
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20080701
Source:
http://ses.informatik.unioldenburg.de/publications/
Dierks
05.pdf
http://ses.informatik.unioldenburg.de/publications/
Dierks
05.pdf
Minimize
Document Type:
text
Language:
en
Subjects:
priced timed automata ; heuristic guided modelchecking ; realtime
priced timed automata ; heuristic guided modelchecking ; realtime
Minimize
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.1245
http://ses.informatik.unioldenburg.de/publications/Dierks05.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.1245
http://ses.informatik.unioldenburg.de/publications/Dierks05.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
5.
Moby/DC — A Tool for ModelChecking Parametric RealTime Specifications
Open Access
Title:
Moby/DC — A Tool for ModelChecking Parametric RealTime Specifications
Author:
Henning Dierks
;
Josef Tapken
Henning Dierks
;
Josef Tapken
Minimize authors
Description:
Abstract. We define an operational subset of Duration Calculus, called phase automata, which serves as an intermediate language for the analysis and verification of realtime system descriptions that contain timing parameters. We introduce the tool MOBY/DC which implements a modelchecking algorithm for phase automata. The algorithm applies comp...
Abstract. We define an operational subset of Duration Calculus, called phase automata, which serves as an intermediate language for the analysis and verification of realtime system descriptions that contain timing parameters. We introduce the tool MOBY/DC which implements a modelchecking algorithm for phase automata. The algorithm applies compositional modelchecking techniques and handles parameters by builtin procedures or by a link to CLP(R). Due to the parameters the modelchecking problem is undecidable in general. Hence, we have to accept that the results are overapproximations only in order to guarantee termination. The overapproximation together with the compositional technique makes the modelchecker especially well suited for proving the absence of error traces instead of finding them.
Minimize
Publisher:
Springer
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20080717
Source:
http://ses.informatik.unioldenburg.de/publications/TACAS03.pdf
http://ses.informatik.unioldenburg.de/publications/TACAS03.pdf
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.1994
http://ses.informatik.unioldenburg.de/publications/TACAS03.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.1994
http://ses.informatik.unioldenburg.de/publications/TACAS03.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
6.
PLCAutomata: A New Class of Implementable RealTime Automata
Open Access
Title:
PLCAutomata: A New Class of Implementable RealTime Automata
Author:
Henning Dierks
Henning Dierks
Minimize authors
Description:
. We introduce a new class of automata which are tailored for dealing with realtime properties modelling the behaviour of Programmable Logic Controllers (PLC) that are often used in practice to solve controlling problems. A semantics in an appropriate temporal logic (Duration Calculus) is given and an implementation schema is presented in a pro...
. We introduce a new class of automata which are tailored for dealing with realtime properties modelling the behaviour of Programmable Logic Controllers (PLC) that are often used in practice to solve controlling problems. A semantics in an appropriate temporal logic (Duration Calculus) is given and an implementation schema is presented in a programming language for PLCs that fits the semantics. Finally, a case study shows the suitability of this approach.
Minimize
Publisher:
SpringerVerlag
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20090412
Source:
http://semantik.informatik.unioldenburg.de/pub/Papers/hd97arts.ps.gz
http://semantik.informatik.unioldenburg.de/pub/Papers/hd97arts.ps.gz
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.6381
http://semantik.informatik.unioldenburg.de/pub/Papers/hd97arts.ps.gz
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.6381
http://semantik.informatik.unioldenburg.de/pub/Papers/hd97arts.ps.gz
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
7.
The Production Cell: A Verified RealTime System
Open Access
Title:
The Production Cell: A Verified RealTime System
Author:
Henning Dierks
Henning Dierks
Minimize authors
Description:
This paper applies and refines the ProCoS approach to transformational design of realtime systems to a benchmark case study, the Karlsruhe production cell [10, 9]. We start by formalizing the informal requirements of [10, 9] in Duration Calculus and end with a distributed controller architecture where all components are specified in the program...
This paper applies and refines the ProCoS approach to transformational design of realtime systems to a benchmark case study, the Karlsruhe production cell [10, 9]. We start by formalizing the informal requirements of [10, 9] in Duration Calculus and end with a distributed controller architecture where all components are specified in the program specification language SL^time [18]. Novel is the full treatment of hybrid system components in a parametric and thus reusable way.
Minimize
Publisher:
Springer
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20090415
Source:
http://semantik.informatik.unioldenburg.de/~
dierks
/Berichte/FTRTFT96.ps.gz
http://semantik.informatik.unioldenburg.de/~
dierks
/Berichte/FTRTFT96.ps.gz
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.3144
http://semantik.informatik.unioldenburg.de/~dierks/Berichte/FTRTFT96.ps.gz
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.3144
http://semantik.informatik.unioldenburg.de/~dierks/Berichte/FTRTFT96.ps.gz
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
8.
A Process Algebra for RealTime Programs
Open Access
Title:
A Process Algebra for RealTime Programs
Author:
Henning Dierks
Henning Dierks
Minimize authors
Description:
We introduce a generalised notion of a realtime specification language ("GPLCAutomata") that can be translated directly into realtime programs. In order to describe the behaviour of several GPLCAutomata implemented on one machine we introduce composition operators which form a process algebra. We give several algebraic laws and prove that eac...
We introduce a generalised notion of a realtime specification language ("GPLCAutomata") that can be translated directly into realtime programs. In order to describe the behaviour of several GPLCAutomata implemented on one machine we introduce composition operators which form a process algebra. We give several algebraic laws and prove that each system is equivalent to a system in a certain normal form. Moreover, we demonstrate how a realtime specification in terms of GPLCAutomata can be decomposed into an untimed part and a timed part.
Minimize
Publisher:
Springer Verlag
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20090415
Source:
http://semantik.informatik.unioldenburg.de/~
dierks
/Berichte/FASE.ps.gz
http://semantik.informatik.unioldenburg.de/~
dierks
/Berichte/FASE.ps.gz
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.3292
http://semantik.informatik.unioldenburg.de/~dierks/Berichte/FASE.ps.gz
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.3292
http://semantik.informatik.unioldenburg.de/~dierks/Berichte/FASE.ps.gz
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
9.
Constructing Test Automata from Graphical RealTime Requirements
Open Access
Title:
Constructing Test Automata from Graphical RealTime Requirements
Author:
Henning Dierks
;
Marc Lettrari
Henning Dierks
;
Marc Lettrari
Minimize authors
Description:
A semantics for a graphical specification language of realtime properties (Constraint Diagrams) is presented. The new semantics is given in terms of Timed Automata. A model in terms of Timed Automata satisfies the property given by a Constraint Diagram if the model in parallel composition with the semantics of the Constraint Diagram can reach a...
A semantics for a graphical specification language of realtime properties (Constraint Diagrams) is presented. The new semantics is given in terms of Timed Automata. A model in terms of Timed Automata satisfies the property given by a Constraint Diagram if the model in parallel composition with the semantics of the Constraint Diagram can reach a certain state. This kind of question can be checked by all modelcheckers for Timed Automata. A prototype of a tool is presented that automatically translates an appropriate Constraint Diagram into the input language of the tool Uppaal.
Minimize
Publisher:
Springer
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20090417
Source:
http://semantik.informatik.unioldenburg.de/~
dierks
/Berichte/FTRTFT02.ps.gz
http://semantik.informatik.unioldenburg.de/~
dierks
/Berichte/FTRTFT02.ps.gz
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.2792
http://semantik.informatik.unioldenburg.de/~dierks/Berichte/FTRTFT02.ps.gz
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.2792
http://semantik.informatik.unioldenburg.de/~dierks/Berichte/FTRTFT02.ps.gz
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
10.
Under consideration for publication in Formal Aspects of Computing Comparing ModelChecking and Logical Reasoning for RealTime Systems
Open Access
Title:
Under consideration for publication in Formal Aspects of Computing Comparing ModelChecking and Logical Reasoning for RealTime Systems
Author:
Henning Dierks
Henning Dierks
Minimize authors
Description:
Abstract. We apply both modelchecking and logical reasoning to a realtime protocol for mutual exclusion. To this end we employ PLCAutomata, an abstract notion of programs for realtime systems. A logic based semantics in terms of Duration Calculus is used to verify the correctness of the protocol by logical reasoning. An alternative but consi...
Abstract. We apply both modelchecking and logical reasoning to a realtime protocol for mutual exclusion. To this end we employ PLCAutomata, an abstract notion of programs for realtime systems. A logic based semantics in terms of Duration Calculus is used to verify the correctness of the protocol by logical reasoning. An alternative but consistent operational semantics in terms of Timed Automata is used to verify the correctness by modelcheckers. Since modelchecking of the full model does not terminate in all cases within acceptable time we examine abstractions and their influence on modelchecking performance. We present two abstraction methods that can be applied successfully for the protocol presented. 1.
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20080701
Source:
http://ses.informatik.unioldenburg.de/publications/FAC04.pdf
http://ses.informatik.unioldenburg.de/publications/FAC04.pdf
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.3710
http://ses.informatik.unioldenburg.de/publications/FAC04.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.3710
http://ses.informatik.unioldenburg.de/publications/FAC04.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
Export Record
All Records
Export
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Adjust your hit list
Sort Your Results
Refine Search Result
More Options
Sort Your Results
Sort by:
Relevance
Author, ZA
Author, AZ
Title, AZ
Title, ZA
Date of publication, descending
Date of publication, ascending
Refine Search Result
Author
(46) The Pennsylvania State University CiteSeerX...
(43) Henning Dierks
(14) Dierks, Henning
(9) Josef Tapken
(8) Gerd Behrmann
(7) Sebastian Kupferschmid
(6) Larsen, Kim Guldstrand
(4) Jörg Hoffmann
(3) Angelika Mader
(3) Ansgar Fehnker
(3) Behrmann, Gerd
(3) Frits Vaandrager
(3) Marc Lettrari
(3) kupferschmid, Sebastian
(2) Andreas Podelski
(2) Bernd Finkbeiner
(2) Cheryl Dietz
(2) Dierks, Claudia
(2) Distl, Ottmar
(2) Ernstrüdiger Olderog
(2) Hamann, Henning
(2) Kim G. Larsen
(2) Kolanus, Waldemar
(2) Lettrari, Marc
(2) Nagel, Wolfgang
(2) Wittwer, Catherine
(1) Amir Pnueli
(1) Becker, Heiko
(1) Berg, Tobias
(1) Binder, Mascha
(1) Boehm, Thomas
(1) Catherine Wittwer
(1) Claudia Dierks
(1) Damm, Werner
(1) Dierks, Christine
(1) Disch, Stefan
(1) DuqueAfonso, Jesús
(1) Equine Chromosome Responsible For
(1) ErnstRüdiger Olderog
(1) Fehnker, Ansgar
(1) Figdor, Carl G.
(1) Frits
(1) Fränzle, Martin
(1) Geiger, Christiane
(1) German Coldblood
(1) Hackanson, Björn
(1) Hagemann, Willem
(1) Hans Fleischhack
(1) Hansen, Michael Reichhardt
(1) Henning Dierks Hans
(1) Henning Dierks Z
(1) Henning Hamann
(1) Hogg, Nancy
(1) Jens Oehlerking
(1) Joints South
(1) Jorg Ho Mann
(1) Kim Larsen
(1) Klaus Dräger
(1) Kremmer, Elisabeth
(1) Lairmore, Michael D.
(1) Lübbert, Michael
(1) Mader, Angelika
(1) Martens, Uwe
(1) Mertelsmann, Roland
(1) Michael Schenke
(1) Ostermann, Georg
(1) Ottmar Distl
(1) Pigorsch, Florian
(1) Sauter, Gerald
(1) Schnitzler, Marc
(1) Scholl, Christoph
(1) Schäfer, Henning S.
(1) Vaandrager, Frits
(1) Waldmann, Uwe
(1) Weber, Christian
(1) Weber, Kim S. C.
(1) Weber, Kim S.C.
(1) Werner Damm
(1) Wirtz, Boris
(1) Zeiser, Robert
(1) Zeitlmann, Lutz
(1) van Kooyk, Yvette
Author:
Subject
(6) real time
(4) duration calculus
(3) formal verification
(3) key words
(3) specification
(2) article
(2) articles
(2) constraint diagrams
(2) d2 1
(2) d2 2
(2) d2 4
(2) d4 7
(2) f3 1
(2) f4 1
(2) plc
(2) plc automata category
(2) plcautomata
(2) programmable logic controllers
(2) requirements capture
(2) semantics
(2) timed automata
(1) directed model checking
(1) fakultät für chemie und pharmazie
(1) formal methods
(1) heuristic guided model checking
(1) info info lo computer science logic in computer...
(1) methods
(1) model checking safety properties
(1) priced timed automata
(1) timing verification
Subject:
Dewey Decimal Classification (DDC)
(7) Computer science, knowledge & systems [00*]
(3) Mathematics [51*]
(2) Life sciences; biology [57*]
(1) Medicine & health [61*]
Dewey Decimal Classification (DDC):
Year of Publication
(28) 2009
(14) 2008
(4) 2002
(4) 2012
(3) 2007
(2) 1969
(2) 2010
(2) 2013
(1) 1998
(1) 2000
(1) 2001
(1) 2011
Year of Publication:
Content Provider
(46) CiteSeerX
(6) Aalborg Univ. (AAU): VBN
(2) HighWire Press
(2) Int. Federation for Information Processing...
(2) PubMed Central
(1) HAL  Hyper Article en Ligne
(1) Denmark Technical Univ.: DTU Orbit
(1) Munich LMU: Digital theses
(1) Aachen RWTH: Publications
(1) Twente Univ.: Publications
Content Provider:
Language
(59) English
(4) Unknown
Language:
Document Type
(50) Text
(12) Article, Journals
(1) Theses
Document Type:
Access
(51) Open Access
(12) Unknown
Access:
More Options
»
Search History
»
Get RSS Feed
»
Get ATOM Feed
»
Email this Search
»
Save Search
»
Browsing
»
Search Plugin
Further result pages
Results:
1

2

3

4

5

6

7
Next »
New Search »
Currently in BASE: 72,247,077 Documents of 3,474
Content Sources
About BASE

Contact

BASE Lab

Imprint
© 20042015 by
Bielefeld University Library
Search powered by
Solr
&
VuFind
.
Suggest Repository
BASE Interfaces
Currently in BASE: 72,247,077 Documents of 3,474 Content Sources
http://www.basesearch.net