Models and temporal logical specifications for timed component connectors

@article{Arbab2006ModelsAT,
  title={Models and temporal logical specifications for timed component connectors},
  author={Farhad Arbab and Christel Baier and Frank S. de Boer and Jan J. M. M. Rutten},
  journal={Software \& Systems Modeling},
  year={2006},
  volume={6},
  pages={59-82}
}
Component-based software engineering advocates construction of software systems through composition of coordinated autonomous components. Significant benefits of this approach include software reuse, simpler and faster construction, enhanced reliability, and dramatic reductions in the complexity of construction of provably correct critical systems, many of which involve real-time concerns. Effective, flexible component composition by itself still poses a challenge today and yet the special… Expand
From Timed Reo Networks to Networks of Timed Automata
TLDR
This work presents a mapping of timed Reo networks to networks of timed automata used for system specification in Uppaal, a state-of-the-art toolset for modeling, validation and verification of real-time systems used in many large-scale industrial projects. Expand
Modeling and Verification of Components and Connectors
TLDR
This paper presents an overview of the modeling concepts for components and connectors using Reo and the underlying constraint automata framework and detail the specification and verification of properties using logics tailored to this framework. Expand
A formal framework capturing real-time and stochastic behavior in connectors
TLDR
This paper proposes a stochastic and real-time extension of Reo, including a set of new primitive channels and an expressive semantics as Stochastic Timed Automata for Reo ( STA r ). Expand
Modeling and verification of component connectors in Coq
TLDR
This paper presents a new approach to modeling and verification of Reo connectors via Coq, a proof assistant based on higher-order logic and λ-calculus, and proposes a simulation-based approach to verify connectors' properties specified in LTL. Expand
Reo + mCRL2 : A framework for model-checking dataflow in service compositions
TLDR
This paper presents a framework for the verification of Reo using the mCRL2 toolset, and unify the previous work on mapping various semantic models for Reo, namely, constraint Automata, timed constraint automata, coloring semantics and the newly developed action constraint automATA, to the process algebraic specification language of mC RL2. Expand
Modeling and Analysis of Component Connectors in Coq
TLDR
This paper presents a new approach to modeling and analysis of Reo connectors via Coq, a proof assistant based on high-order logic and \(\lambda \)-calculus that can automatically prove connectors’ properties using the Coq proof assistant. Expand
Automata-Based Timed Event Program Comprehension for Real-Time Systems
In this paper, we extend the software space of program comprehension to real-time systems and introduce two orthogonal and hybrid paradigms that we refer to as timed event component comprehension andExpand
SAT-based verification for timed component connectors
  • S. Kemper
  • Computer Science
  • Sci. Comput. Program.
  • 2012
TLDR
This paper presents a SAT-based approach for bounded model checking of Timed Constraint Automata, which permits true concurrency in the timed orchestration of components, and presents an embedding of bounded modelchecking into propositional logic with linear arithmetic. Expand
Capturing Stochastic and Real-Time Behavior in Reo Connectors
TLDR
This paper proposes a stochastic and real-time extension of Reo, including a set of new primitive channels and an expressive semantics named Stochastic Timed Automata for Reo (\(\text {STA}_r\)). Expand
Formal Design and Verification of Long-Running Transactions with Extensible Coordination Tools
TLDR
This paper presents a framework for behavioral modeling of business processes, focusing on their transactional properties, based on the channel-based coordination language Reo, which is an expressive, compositional, and semantically precise design language admitting formal reasoning. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 40 REFERENCES
Reo: a channel-based coordination model for component composition
  • F. Arbab
  • Computer Science
  • Mathematical Structures in Computer Science
  • 2004
TLDR
It is shown that exogenous coordination patterns that can be expressed as (meta-level) regular expressions over I/O operations can be composed in Reo out of a small set of only five primitive channel types. Expand
Modeling Component Connectors in Reo by Constraint Automata: (Extended Abstract)
TLDR
Constraint automata are introduced and proposed as a semantic model for Reo, an exogenous coordination language for compositional construction of component connectors based on a calculus of channels. Expand
Verifying Abstractions of Timed Systems
TLDR
A compositional framework for the implementation check to be carried out in a module-by-module manner using assume-guarantee style proof rules is developed and it is shown that the problem of checking the existence of timed simulation relations, a sufficient condition for correct implementation, is decidable. Expand
A Coinductive Calculus of Component Connectors
TLDR
A simple and transparent semantical model for Reo, in which connectors are relations on timed data streams, and coinduction is the main reasoning principle and it is used to prove properties such as connector equivalence. Expand
The Benefits of Relaxing Punctuality
TLDR
This work introduces a temporal language that can constrain the time difference between events only with finite, yet arbitrary, precision and show the resulting logic to be EXPSPACE-complete. Expand
A Timed Model for Communicating Sequential Processes
TLDR
The purpose of this paper is to report the development of the first real-time models of CSP to be compatible with the properties and proof systems of the abovementioned untimed models. Expand
Symbolic Model Checking for Real-Time Systems
TLDR
It is shown that the expressiveness of the timed μ-calculus is incomparable to theexpressiveness of timed CTL, which does not impair the symbolic verification of "implementable" real-time programs-those whose safety constraints are machine-closed with respect to diverging time and whose fairness constraints are restricted to finite upper bounds on clock values. Expand
Time-Constrained Automata (Extended Abstract)
TLDR
A way to add a notion of time to the input-output automaton model in a way that preserves these properties is described, and the result is a simple, compositional model for real-time computation that provides a convenient notation for expressing timing properties such as bounded fairness. Expand
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
This thesis is concerned with the modeling and performance analysis of systems which consist of concurrently acting components, an example of which is an asynchronous pipelined processor. The work isExpand
A Theory of Timed Automata
TLDR
The main construction of the paper is an (PSPACE) algorithm for checking the emptiness of the language of a (nondeterministic) timed automaton, and it is proved that the universality problem and the language inclusion problem are solvable only for the deterministic automata. Expand
...
1
2
3
4
...