A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Synthesizing controllers from Duration Calculus
[chapter]

1996
*
Lecture Notes in Computer Science
*

Due to the abstractness

doi:10.1007/3-540-61648-9_40
fatcat:sfuxmf3oyjhzhhxcyix3tjdopi
*of*the vocabulary*of**Duration**Calculus*, trajectory inclusion between control requirements*and*controller designs is undecidable even for fully synchronous controllers, rendering ... As far as we know, this is the rst positive result concerning feasibility*of*automatic synthesis from dense-time*Duration**Calculus*. ? ... The author is grateful to the researchers*of*the ProCoS project for sharing their insight into implementation demands*and*correctness issues*of*embedded systems, particularly to Markus M uller-Olm for ...##
###
On Expressive Completeness of Duration and Mean Value Calculi (Extended Abstract)

1997
*
Electronical Notes in Theoretical Computer Science
*

We provide a characterization

doi:10.1016/s1571-0661(05)80476-1
fatcat:imuhell3zjatbjiuj5yfh5qmje
*of*the expressive p o wer*of*the propositional*duration**calculus**and*investigate the connections between the propositional*duration**calculus**and*star-free regular expressions ...*of*real-time systems, the propositional versions*of**duration**and*mean value calculi. ... In section 4 the syntax*and*the*semantics**of**duration**calculus**and**of*mean-value*calculus*are provided. Section 5 gives the expressive*completeness*theorem. ...##
###
Page 1106 of Mathematical Reviews Vol. , Issue 96b
[page]

1996
*
Mathematical Reviews
*

Thus we show that @,-lambda models are

*complete*for the 1fy-*calculus*.” ... with*durational*actions. ...##
###
Expressive Completeness of Duration Calculus

2000
*
Information and Computation
*

Our results show that the propositional

doi:10.1006/inco.1999.2816
fatcat:bfkol7uncfardea2oc2xkjlvvq
*duration**calculus*is expressively*complete*for first-order monadic logic*of*order. ... This paper compares the expressive power*of*first-order monadic logic*of*order, a fundamental formalism in mathematical logic*and*the theory*of*computation, with that*of*the Propositional version*of**Duration*... Acknowledgment I would like to thank Alexander Dikovsky*and*the anonymous referees for their helpful suggestions. ...##
###
A duration calculus with infinite intervals
[chapter]

1995
*
Lecture Notes in Computer Science
*

The extended

doi:10.1007/3-540-60249-6_39
fatcat:5ckknjo7wnh3zgol2cb7ed2sia
*calculus*defines a state*duration*over an infinite interval by a property which specifies the limit*of*the state*duration*over finite intervals,*and*excludes the description operator. ... With limits*of*state*durations*, one can treat conventional liveness*and*fairness,*and*can also measure liveness*and*fairness through properties*of*limits. ... We cannot conclude the*completeness**of*the inference system in the paper.*Duration**Calculus*(DC) In this section, the*Duration**Calculus*is briefly reviewed [31] . ...##
###
Duration Calculus of Weakly Monotonic Time
[chapter]

1998
*
Lecture Notes in Computer Science
*

The resulting logic is called

doi:10.1007/bfb0055336
fatcat:4ela2mukqje4fj6v725mmw5xly
*Duration**Calculus**of*Weakly Monotonic Time (W DC). It allows e ects such as true synchrony*and*digitisation to be modelled. ... As an example*of*this, we formulate a novel*semantics**of*Timed CSP assuming that the communication*and*computation take no time. ... We have given a straightforward extension*of**Duration**Calculus*for weakly monotonic time. ...##
###
Page 7840 of Mathematical Reviews Vol. , Issue 2003j
[page]

2003
*
Mathematical Reviews
*

It would be interesting to see how it compares with the

*Duration**Calculus*with probability (I’m not aware if the*Duration**Calculus*has been extended to support probability, which would be something interesting ... The z-*calculus*is one*of*the most recent*and*most successful*of*the languages proposed in the literature. ...##
###
Page 6642 of Mathematical Reviews Vol. , Issue 2001I
[page]

2001
*
Mathematical Reviews
*

(electronic), Elsevier, Amsterdam, 1997; see MR 98g:68005; Inform.

*and*Comput. 156 (2000), no. 1-2, 320-344] we established the expressive*completeness**of*the propositional fragment*of*the*duration**calculus*... Hence, there exists an exponential gap between the succinctness*of*monadic logic*and*that*of**duration**calculus*.” 20011:68115 68Q60 68N17 Volpe, Paolo (I-PISA-IF; Pisa) A first-order language for expressing ...##
###
Page 1308 of Mathematical Reviews Vol. , Issue 2002B
[page]

2002
*
Mathematical Reviews
*

In two previous papers the authors have proposed a multiset

*semantics*for the z-*calculus*with replication*and*proven that two processes*of*this*calculus*are structurally congruent (for a natural extension ... A study on the size*of*the labelled transition systems describing the transitional*semantics**of*CIPA processes*and*those describing the transitional*semantics**of*their translated versions is also presented ...##
###
Completeness and Decidability of a Fragment of Duration Calculus with Iteration
[chapter]

1999
*
Lecture Notes in Computer Science
*

*Duration*

*Calculus*with Iteration (DC ) has been used as an interface between original

*Duration*

*Calculus*

*and*Timed Automata, but has not been studied rigorously. ... We give a

*complete*proof system

*and*the decidability results for the subset. ... In the next section, we give the syntax

*and*

*semantics*

*of*our

*Duration*

*Calculus*with Iteration. In the third section we will give a proof system for the

*calculus*. ...

##
###
Towards a duration calculus proof assistant in PVS
[chapter]

1994
*
Lecture Notes in Computer Science
*

The resulting system, called PC/DC, retains the speci cation

doi:10.1007/3-540-58468-4_189
fatcat:qrdwfuye2zfr7itswff4t4fwvu
*and*veri cation capabilities*of*PVS within the framework*of*the*Duration**Calculus*. ... We exploit the similarity between the sequent*calculus**of*PVS*and*the sequent*calculus**of*DC to obtain a DC proof system where the proofs are carried out in PVS at the*semantic*level, but appear as proofs ... Ravn, Hans Rischel, Friedrich von Henke,*and*the anonymous referees. ...##
###
A General Framework for Nondeterministic, Probabilistic, and Stochastic Noninterference
[chapter]

2009
*
Lecture Notes in Computer Science
*

sub-

doi:10.1007/978-3-642-03459-6_2
fatcat:6veewiqxpfhafmlwif3vfoqyb4
*calculus*. •*Semantics*: labeled transition system. • Noninterference check: positive. ... The set*of*process terms is generated by the following syntax: P ::= 0 | <a,λ>.P | P + P | A | P/L | P S P From this*calculus*it is straightforward to derive a nondeterministic sub-*calculus**and*a probabilistic ... actions with zero*duration*Bisimulation*semantics*An equivalence relation B ⊆ P ×P is a weak extended Markovian bisimulation iff, whenever (P 1 , P 2 ) ∈ B, then for all action names a ∈ Name*and*levels ...##
###
Real-Time Systems Development with Duration Calculi: An Overview
[chapter]

2003
*
Lecture Notes in Computer Science
*

*Duration*

*Calculus*was originally introduced in 1991 as a powerful logic for specifying the safety

*of*realtime systems. ... Starting from the requirement R

*of*the plant

*and*the assumption E about the behaviour

*of*the environment: ...

*Duration*

*Calculus*

*and*Some

*of*Its New Features Research

*and*development

*of*

*Duration*

*Calculus*was initiated in [6] . ...

##
###
Towards a formal semantics of verilog using duration calculus
[chapter]

1998
*
Lecture Notes in Computer Science
*

We formalise the

doi:10.1007/bfb0055355
fatcat:njxdwcbmwjgp3fnuate3zdjgwu
*semantics**of*V-, a simple version*of*Verilog hardware description language using an extension*of**Duration**Calculus*. ... V-programs can exhibit a rich variety*of*computations,*and*it is therefore necessary to extend*Duration**Calculus*with several features, including Weakly Monotonic Time, infinite intervals*and*fixed point ... initial stage*of*this work. ...##
###
Page 5104 of Mathematical Reviews Vol. , Issue 2000g
[page]

2000
*
Mathematical Reviews
*

The resulting interpretation is expected to make it generally easier to establish

*semantic*links be- tween*duration**calculus**and*formalisms aimed at programming. ... Such*semantic*links are prerequisites for a solid underpinning*of*approaches to system development that cover requirement capture through coding using both*duration**calculus**and*some formal- ism(s) aimed ...
« Previous

*Showing results 1 — 15 out of 6,181 results*