(Enter summary)
Abstract: The main concern of this thesis is the formal reasoning about reactive systems, that is, systems
that repeatedly act and react in interaction with their environment without necessarily
terminating. When describing such systems the focus is not on what is computed but rather
on the interaction capabilities over time. Moreover, reactive systems are usually highly concurrent,
typically spatially distributed, and often non-deterministic. Such systems include
telecommunication protocols, telephone... (Update)
Context of citations to this paper: More
...above. We conclude this introduction by mentioning another two very interesting contributions to the synthesis problem. [Sun98, Chapter 5] considers the case that the specification of the desired behaviour is given as a temporal logic formula and presents an effective...
Cited by: More
Concurrent Implementation of Asynchronous Transition Systems - Vogler (1998)
(Correct)
Similar documents (at the sentence level):
6.6%: Further Results on Partial Order Equivalences on Infinite Systems - Sunesen (1998)
(Correct)
Active bibliography (related documents): More All
0.5: Language Containment Checking with Nondeterministic BDDs - Finkbeiner
(Correct)
0.1: Message-Passing Automata Are Expressively Equivalent to EMSO.. - Bollig, Leucker (2004)
(Correct)
0.1: Local Normal Forms for First-Order Logic with.. - Schwentick, Barthelmann (1999)
(Correct)
Similar documents based on text: More All
1.3: Topics in Semantics-based Program Manipulation - Grobauer (2001)
(Correct)
1.3: Worst Case Efficient Data Structures - Brodal (1997)
(Correct)
1.1: Efficient External-Memory Data Structures and Applications - Arge (1996)
(Correct)
BibTeX entry: (Update)
K. Sunesen. Reasoning about Reactive Systems. PhD thesis, Univ. Aarhus, 1998. http://citeseer.ist.psu.edu/sunesen98reasoning.html More
@misc{ sunesen98reasoning,
author = "K. Sunesen",
title = "Reasoning about Reactive Systems",
text = "K. Sunesen. Reasoning about Reactive Systems. PhD thesis, Univ. Aarhus,
1998.",
year = "1998",
url = "citeseer.ist.psu.edu/sunesen98reasoning.html" }
Citations (may not include all citations):
434
An automata-theoretic approach to automatic program verifica.. (context) - Vardi, Wolper - 1986
374
Automata on infinite objects (context) - Thomas - 1990
144
Models for concurrency
- Winskel, Nielsen - 1995
128
An automata-theoretic approach to linear temporal logic
- Vardi - 1996
125
Event structures (context) - Winskel
58
Equivalence notions for concurrent systems and refinement of.. (context) - van Glabbeek, Goltz - 1989
58
Theoretical Computer Science (context) - Winskel - 1984
53
automata and logic (context) - Thomas - 1997
47
A trace based extension of linear time temporal logic (context) - Thiagarajan - 1994
39
Partial-order methods for temporal verification (context) - Wolper, Godefroid - 1993
38
Event structure semantics for CCS and related languages (context) - Winskel
21
Comparative concurrency semantics and refinement of actions (context) - van Glabbeek - 1990
20
Elementary net systems (context) - Thiagarajan
14
Automata theory on trees and partial orders
- Thomas - 1997
13
Elements of automata theory over partial orders
- Thomas - 1996
11
morphisms and compositionality (context) - Winskel
2
The automata theory package omega
- Voge, Matz et al. - 1997
Documents on the same site (http://www.brics.dk/DS/Ref/BRICS-DS-Ref/BRICS-DS-Ref.html): More
Logics and Automata for Verification: Expressiveness and.. - Henriksen (2000)
(Correct)
Dynamic Computation - Husfeldt (1997)
(Correct)
Games for Verification: Algorithmic Issues - Jurdzinski (2000)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC