A framework based on implementation relations for implementing LOTOS specifications

Leduc, Guy

doi:10.1016/0169-7552(92)90122-7

Cited by 37 publications

(34 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The second notion, conformance simulations, captures the conformance relations [9,12] that several authors introduced in order to formalize the notion of possible implementations. Like covariant-contravariant simulations, they can be defined as coalgebraic simulations for some stable order which is not right-stable neither left-stable.…”

Section: Introduction and Presentation Of Our New Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Non-strongly Stable Orders Also Define Interesting Simulation Relations

Fábregas¹,

Frutos-Escrig²,

Palomino³

2009

Algebra and Coalgebra in Computer Science

View full text Add to dashboard Cite

Abstract. We present a study of the notion of coalgebraic simulation introduced by Hughes and Jacobs. Although in their original paper they allow any functorial order in their definition of coalgebraic simulation, for the simulation relations to have good properties they focus their attention on functors with orders which are strongly stable. This guarantees a so-called "composition-preserving" property from which all the desired good properties follow. We have noticed that the notion of strong stability not only ensures such good properties but also "distinguishes the direction" of the simulation. For example, the classic notion of simulation for labeled transition systems, the relation "p is simulated by q", can be defined as a coalgebraic simulation relation by means of a strongly stable order, whereas the opposite relation, "p simulates q", cannot. Our study was motivated by some interesting classes of simulations that illustrate the application of these results: covariant-contravariant simulations and conformance simulations.

show abstract

Section: Introduction and Presentation Of Our New Resultsmentioning

confidence: 99%

“…The other new kind of simulations in which we are interested is that of conformance simulations, where the conformance relation in [9,12] meets the simulation world in a nice way. In the definition below we will write p a −→ if p a −→ p for some p .…”

Section: Covariant-contravariant Simulations and Conformance Simulationsmentioning

confidence: 99%

Non-strongly Stable Orders Also Define Interesting Simulation Relations

Fábregas¹,

Frutos-Escrig²,

Palomino³

2009

Algebra and Coalgebra in Computer Science

View full text Add to dashboard Cite

show abstract

“…Afterwards, prototypes are implemented for a first investigation of the system behavior in real environments. Prototype derivation techniques support the (semi)automatic development of prototypes from a concrete, implementation-oriented formal specification [6]. Validation techniques can be used to (semi)formally prove that prototypes (and subsequent implementations) meet their specifications [4].…”

Section: Predicting the Performance Of Lotos Prototypesmentioning

confidence: 99%

Performance-oriented formal specifications — the LotoTis approach

Schieferdecker

1995

TAPSOFT '95: Theory and Practice of Software Development

View full text Add to dashboard Cite

Abstract. The paper presents the performance-oriented, LOTOS extension LoToTIs. LoToTIs allows us to specify performance-oriented behavior via quantified time~ quantified nondeterminism~ quantified parallelism, and action monitoring. It offers a set of refinement rules from LOTOS to LoToTIs. Therefore~ LoToTIs supports the standard conform development of performance-oriented specifications from existing LOTOS specifications. Performance Evaluation based on Formal SpecificationsIn the mid eighties [10] there was already recognized that specifying performance requirements can be as important as specifying functional requirements of distributed systems. However, formal specification techniques covered so far primarily functional aspects for the investigation of the functional correctness of distributed systems. Hence, it was (and is still) not unusual that a system is fully implemented or at least implemented as a prototype before any attempt is made to investigate its performance. However, costly re-prototyping or reimplementation can be avoided, if performance could be predicted from the specification of a distributed system. A framework, which supports functional and performance-oriented behavior specification, and which allows us to evaluate performance from that specification would offer major advantages. For this purpose, new concepts have to be incorporated into formal specification techniques. Only recently, there had been published some proposals that close the gap between formal specification and performance evaluation [1]. This paper presents the LoToTIs approach that is a newly-designed performance-oriented formal description technique (FDT). Its main advantage is the upward compatibility with LOTOS that is one of the internationally standardized FDTs [5]. After introducing the main concepts of LoToTIs, we present the language and give an insight into its semantics. The most important properties of LoToTIs are given. The paper finishes with a methodology based on the LoTos/LoToTIS framework that supports the development of standard conform prototypes and the prediction of their performance.

show abstract

“…Concerning conformance simulation, the first related references are also quite old [10] and correspond to the notion of conformance testing, which is close to failure semantics [13]. However, it is a bit surprising that in both cases there is lack of a basic theory where these notions are presented in a simplified scenario, stressing their main characteristics and properties.…”

Section: Introduction and Some Related Workmentioning

confidence: 99%

“…The intention is that simulations will treat the actions in Act l like in the ordinary case, they will interchange the roles of the related processes for those actions in Act r , and they will impose a symmetric condition (like that defining bisimulation) for the actions in Act bi . The second notion, conformance simulation, captures the conformance relations [10] that several authors introduced in order to formalize the notion of possible implementations.…”

Section: Introduction and Some Related Workmentioning

confidence: 99%

Logics for Contravariant Simulations

Fábregas¹,

Frutos-Escrig²,

Palomino³

2010

Formal Techniques for Distributed Systems

View full text Add to dashboard Cite

Abstract. Covariant-contravariant simulation and conformance simulation are two generalizations of the simple notion of simulation which aim at capturing the fact that it is not always the case that "the larger the number of behaviors, the better". Therefore, they can be considered to be more adequate to express the fact that a system is a correct implementation of some specification. We have previously shown that these two more elaborated notions fit well within the categorical framework developed to study the notion of simulation in a generic way. Now we show that their behaviors have also simple and natural logical characterizations, though more elaborated than those for the plain simulation semantics.

show abstract

A framework based on implementation relations for implementing LOTOS specifications

Cited by 37 publications

References 16 publications

Non-strongly Stable Orders Also Define Interesting Simulation Relations

Non-strongly Stable Orders Also Define Interesting Simulation Relations

Performance-oriented formal specifications — the LotoTis approach

Logics for Contravariant Simulations

Contact Info

Product

Resources

About