2006
DOI: 10.1007/11817949_1
|View full text |Cite
|
Sign up to set email alerts
|

Modeling Timed Concurrent Systems

Abstract: Timed concurrent systems are widely used in concurrent and distributed real-time software, modeling of hybrid systems, design of hardware systems (using hardware description languages), discrete-event simulation, and modeling of communication networks. They consist of concurrent components that communicate using timed signals, that is, sets of (semantically) time-stamped events. The denotational semantics of such systems is traditionally formulated in a metric space, wherein causal components are modeled as co… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
39
0

Year Published

2006
2006
2020
2020

Publication Types

Select...
7
3

Relationship

6
4

Authors

Journals

citations
Cited by 32 publications
(39 citation statements)
references
References 21 publications
0
39
0
Order By: Relevance
“…It has played a crucial role in allowing us to explore the language design space and to converge on an expressive, minimal syntax for modeling hybrid systems and on a formal (exact) semantics for solutions. Among other design choices, it allowed us to make an early decision to support the notion of super-dense time, first introduced in the verification literature [12], and later advocated by Liu, Matsikoudis and Lee [11]. This notion facilitates modeling of discrete subsystems with multiple idealized (zero time) and externally-observable internal transitions.…”
Section: A Syntax and Informal Semanticsmentioning
confidence: 99%
“…It has played a crucial role in allowing us to explore the language design space and to converge on an expressive, minimal syntax for modeling hybrid systems and on a formal (exact) semantics for solutions. Among other design choices, it allowed us to make an early decision to support the notion of super-dense time, first introduced in the verification literature [12], and later advocated by Liu, Matsikoudis and Lee [11]. This notion facilitates modeling of discrete subsystems with multiple idealized (zero time) and externally-observable internal transitions.…”
Section: A Syntax and Informal Semanticsmentioning
confidence: 99%
“…Non-causal I/O relationships are problematic. Semantics of discrete-event, continuous-time, and hybrid systems models all rely on causal I/O relationships [22,8,11,12,14].…”
Section: Zero-crossing Detectormentioning
confidence: 99%
“…At the same time, it may well be that the relevant fixed-point theorem of Priess-Crampe and Ribenboim is independent of the theory of generalized ultrametric spaces in the classical Zermelo-Fraenkel set theory without choice, thus lacking a constructive proof altogether. 33 The answer lies in the non-constructive proof of Theorem 5.2. Indeed, the proof contains all the ingredients of a transfinite recursion facilitating the construction of a chain that may effectively substitute for the maximal one only asserted to exist therein by an appeal to Kuratowski's Lemma.…”
Section: Constructionmentioning
confidence: 99%