The Experts below are selected from a list of 67593 Experts worldwide ranked by ideXlab platform
Kim G. Larsen - One of the best experts on this subject based on the ideXlab platform.
-
Real-time specifications
International Journal on Software Tools for Technology Transfer, 2015Co-Authors: Alexandre David, Kim G. Larsen, Ulrik Nyman, Louis-marie Traonouez, Axel Legay, Andrzej WąsowskiAbstract:A specification theory combines notions of specifications and implementations with a Satisfaction Relation, a refinement Relation, and a set of operators supporting stepwise design. We develop a specification framework for real-time systems using Timed I/O Automata as the specification formalism, with the semantics expressed in terms of Timed I/O Transition Systems. We provide constructs for refinement, consistency checking, logical and structural composition, and quotient of specifications—all indispensable ingredients of a compositional design methodology. The theory is implemented in the new tool Ecdar . We present symbolic versions of the algorithms used in Ecdar , and demonstrate the use of the tool using a small case study in compositional verification.
-
MFCS - Taking it to the limit: approximate reasoning for markov processes
Mathematical Foundations of Computer Science 2012, 2012Co-Authors: Kim G. Larsen, Radu Mardare, Prakash PanangadenAbstract:We develop a fusion of logical and metrical principles for reasoning about Markov processes. More precisely, we lift metrics from processes to sets of processes satisfying a formula and explore how the Satisfaction Relation behaves as sequences of processes and sequences of formulas approach limits. A key new concept is dynamically-continuous metric bisimulation which is a property of (pseudo)metrics. We prove theorems about Satisfaction in the limit, robustness theorems as well as giving a topological characterization of various classes of formulas. This work is aimed at providing approximate reasoning principles for Markov processes.
-
HSCC - Timed I/O automata: a complete specification theory for real-time systems
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control - HSCC '10, 2010Co-Authors: Alexandre David, Kim G. Larsen, Ulrik Nyman, Axel Legay, Andrzej WąsowskiAbstract:A specification theory combines notions of specifications and implementations with a Satisfaction Relation, a refinement Relation and a set of operators supporting stepwise design. We develop a complete specifification framework for real-time systems using Timed I/O Automata as the specification formalism, with the semantics expressed in terms of Timed I/O Transition Systems. We provide constructs for refinement, consistency checking, logical and structural composition, and quotient of specifications --- all indispensable ingredients of a compositional design methodology. The theory is implemented on top of an engine for timed games, Uppaal-tiga, and illustrated with a small case study.
-
timed i o automata a complete specification theory for real time systems
ACM International Conference Hybrid Systems: Computation and Control, 2010Co-Authors: Alexandre David, Kim G. Larsen, Ulrik Nyman, Axel Legay, Andrzej WasowskiAbstract:A specification theory combines notions of specifications and implementations with a Satisfaction Relation, a refinement Relation and a set of operators supporting stepwise design. We develop a complete specifification framework for real-time systems using Timed I/O Automata as the specification formalism, with the semantics expressed in terms of Timed I/O Transition Systems. We provide constructs for refinement, consistency checking, logical and structural composition, and quotient of specifications --- all indispensable ingredients of a compositional design methodology. The theory is implemented on top of an engine for timed games, Uppaal-tiga, and illustrated with a small case study.
-
MEMICS - A quantitative characterization of weighted Kripke structures in temporal logic
2009Co-Authors: Kim G. Larsen, Uli Fahrenberg, Claus ThraneAbstract:We extend the usual notion of Kripke Structures with a weighted transition Relation, and generalize the usual Boolean Satisfaction Relation of CTL to a map which assigns to states and temporal formulae a real-valued distance describing the degree of Satisfaction. We describe a general approach to obtaining quantitative interpretations for a generic extension of the CTL syntax, and show that, for one such interpretation, the logic is both adequate and expressive with respect to quantitative bisimulation.
Alexandre David - One of the best experts on this subject based on the ideXlab platform.
-
Real-time specifications
International Journal on Software Tools for Technology Transfer, 2015Co-Authors: Alexandre David, Kim G. Larsen, Ulrik Nyman, Louis-marie Traonouez, Axel Legay, Andrzej WąsowskiAbstract:A specification theory combines notions of specifications and implementations with a Satisfaction Relation, a refinement Relation, and a set of operators supporting stepwise design. We develop a specification framework for real-time systems using Timed I/O Automata as the specification formalism, with the semantics expressed in terms of Timed I/O Transition Systems. We provide constructs for refinement, consistency checking, logical and structural composition, and quotient of specifications—all indispensable ingredients of a compositional design methodology. The theory is implemented in the new tool Ecdar . We present symbolic versions of the algorithms used in Ecdar , and demonstrate the use of the tool using a small case study in compositional verification.
-
HSCC - Timed I/O automata: a complete specification theory for real-time systems
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control - HSCC '10, 2010Co-Authors: Alexandre David, Kim G. Larsen, Ulrik Nyman, Axel Legay, Andrzej WąsowskiAbstract:A specification theory combines notions of specifications and implementations with a Satisfaction Relation, a refinement Relation and a set of operators supporting stepwise design. We develop a complete specifification framework for real-time systems using Timed I/O Automata as the specification formalism, with the semantics expressed in terms of Timed I/O Transition Systems. We provide constructs for refinement, consistency checking, logical and structural composition, and quotient of specifications --- all indispensable ingredients of a compositional design methodology. The theory is implemented on top of an engine for timed games, Uppaal-tiga, and illustrated with a small case study.
-
timed i o automata a complete specification theory for real time systems
ACM International Conference Hybrid Systems: Computation and Control, 2010Co-Authors: Alexandre David, Kim G. Larsen, Ulrik Nyman, Axel Legay, Andrzej WasowskiAbstract:A specification theory combines notions of specifications and implementations with a Satisfaction Relation, a refinement Relation and a set of operators supporting stepwise design. We develop a complete specifification framework for real-time systems using Timed I/O Automata as the specification formalism, with the semantics expressed in terms of Timed I/O Transition Systems. We provide constructs for refinement, consistency checking, logical and structural composition, and quotient of specifications --- all indispensable ingredients of a compositional design methodology. The theory is implemented on top of an engine for timed games, Uppaal-tiga, and illustrated with a small case study.
Peter Ochsenschläger - One of the best experts on this subject based on the ideXlab platform.
-
Reliability Aspects of Uniformly Parameterised Cooperations
2012Co-Authors: Peter Ochsenschläger, Roland RiekeAbstract:In this paper, we examine reliability aspects of systems, which are characterised by the composition of a set of identical components. These components interact in a uniform manner, described by the schedules of the partners. Such kind of interaction is typical for scalable complex systems with cloud or grid structure. We call these systems "uniformly parameterised cooperations". We consider reliability of such systems in a possibilistic sense. This is formalised by always- eventually properties, a special class of liveness properties using a modified Satisfaction Relation, which expresses possibilities. As a main result, a finite state verification framework for uniformly parameterised reliability properties is given. The keys to this framework are structuring cooperations into phases and defining closed behaviours of systems. In order to verify reliability properties of such uniformly parameterised cooperations, we use finite state semi-algorithms that are independent of the concrete parameter setting.
-
PDP - Security Requirements for Uniformly Parameterised Cooperations
2012 20th Euromicro International Conference on Parallel Distributed and Network-based Processing, 2012Co-Authors: Peter Ochsenschläger, Roland RiekeAbstract:The specification of security requirements is an important step when specifying new systems and systems of systems or analyzing existing systems with regard to security issues. A common way to formally specify security requirements is by means of safety and liveness properties. The systems in the focus of this paper are uniformly parameterised co operations. Such systems are characterised by the composition of a set of identical components. These components interact in a uniform manner described by the schedules of the partners. Such a kind of interaction is typical for scalable complex systems with a cloud or grid structure. As a main result, a formalism to specify uniformly parameterised behaviour properties of cooperations is given. To capture possibilistic aspects of especially liveness properties, a modified Satisfaction Relation is used. For safety properties, this Relation, which is called approximate Satisfaction, is equivalent to the usual one.
-
FLAIRS Conference - Verification of Cooperating Systems - An Approach Based on Formal Languages
2000Co-Authors: Peter Ochsenschläger, Jürgen Repp, Roland RiekeAbstract:Behaviour of systems is described by formal lan- guages: the sets of all sequences of actions. Regarding abstraction, alphabetic language homomorphisms are used to compute abstract behaviours. To avoid loss of important information when moving to the abstract level, abstracting homomorphisms have to satisfy a certain property called simplicity on the concrete (i.e. not abstracted) behaviour. To be suitable for verication of so called cooperating systems, a modied type of Satisfaction Relation for system properties (approximate Satisfaction) is considered. The well known state space explosion problem is tackled by a compositional method formalised by so called cooperation products of formal languages.
-
Abstraction and composition: a verification method for co-operating systems
Journal of Experimental & Theoretical Artificial Intelligence, 2000Co-Authors: Peter Ochsenschläger, Jürgen Repp, Roland RiekeAbstract:Behaviour of systems is described by formal languages: the sets of all sequences of actions. Regarding abstraction, alphabetic language homomorphisms are used to compute abstract behaviours. To avoid loss of important information when moving to the abstract level, abstracting homomorphisms have to satisfy a certain property called simplicity on the concrete (i.e. not abstracted) behaviour. To be suitable for verification of so called co-operating systems, a modified type of Satisfaction Relation for system properties (approximate Satisfaction) is considered. The well known state space explosion problem is tackled by a compositional method formalized by so called co-operation products of formal languages.
-
The SH-verification tool : Abstraction-based verification of Co-operating systems
Formal Aspects of Computing, 1998Co-Authors: Peter Ochsenschläger, Jürgen Repp, Roland Rieke, Ulrich NitscheAbstract:The sh-verification tool comprises computing abstractions of finite-state behaviour representations as well as automata and temporal logic based verification approaches. To be suitable for the verification of so called co-operating systems, a modified type of Satisfaction Relation (approximate Satisfaction) is considered. Regarding abstraction, alphabetic language homomorphisms are used to compute abstract behaviours. To avoid loss of important information when moving to the abstract level, abstracting homomorphisms have to satisfy a certain property called simplicity on the concrete (i.e. not abstracted) behaviour. The well known state space explosion problem is tackled by a compositional method combined with a partial order method.
Axel Legay - One of the best experts on this subject based on the ideXlab platform.
-
Real-time specifications
International Journal on Software Tools for Technology Transfer, 2015Co-Authors: Alexandre David, Kim G. Larsen, Ulrik Nyman, Louis-marie Traonouez, Axel Legay, Andrzej WąsowskiAbstract:A specification theory combines notions of specifications and implementations with a Satisfaction Relation, a refinement Relation, and a set of operators supporting stepwise design. We develop a specification framework for real-time systems using Timed I/O Automata as the specification formalism, with the semantics expressed in terms of Timed I/O Transition Systems. We provide constructs for refinement, consistency checking, logical and structural composition, and quotient of specifications—all indispensable ingredients of a compositional design methodology. The theory is implemented in the new tool Ecdar . We present symbolic versions of the algorithms used in Ecdar , and demonstrate the use of the tool using a small case study in compositional verification.
-
HSCC - Timed I/O automata: a complete specification theory for real-time systems
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control - HSCC '10, 2010Co-Authors: Alexandre David, Kim G. Larsen, Ulrik Nyman, Axel Legay, Andrzej WąsowskiAbstract:A specification theory combines notions of specifications and implementations with a Satisfaction Relation, a refinement Relation and a set of operators supporting stepwise design. We develop a complete specifification framework for real-time systems using Timed I/O Automata as the specification formalism, with the semantics expressed in terms of Timed I/O Transition Systems. We provide constructs for refinement, consistency checking, logical and structural composition, and quotient of specifications --- all indispensable ingredients of a compositional design methodology. The theory is implemented on top of an engine for timed games, Uppaal-tiga, and illustrated with a small case study.
-
timed i o automata a complete specification theory for real time systems
ACM International Conference Hybrid Systems: Computation and Control, 2010Co-Authors: Alexandre David, Kim G. Larsen, Ulrik Nyman, Axel Legay, Andrzej WasowskiAbstract:A specification theory combines notions of specifications and implementations with a Satisfaction Relation, a refinement Relation and a set of operators supporting stepwise design. We develop a complete specifification framework for real-time systems using Timed I/O Automata as the specification formalism, with the semantics expressed in terms of Timed I/O Transition Systems. We provide constructs for refinement, consistency checking, logical and structural composition, and quotient of specifications --- all indispensable ingredients of a compositional design methodology. The theory is implemented on top of an engine for timed games, Uppaal-tiga, and illustrated with a small case study.
-
Compositional Design Methodology with Constraint Markov Chains
2009Co-Authors: Benoit Caillaud, Kim G. Larsen, Axel Legay, Benoît Delahaye, Mikkel L. Pedersen, Andrzej WasowskiAbstract:A specification theory combines notions of specification and implementation with a Satisfaction Relation, a refinement Relation and a set of operators that together support stepwise design. We propose a new abstraction, Constraint Markov Chains, and use it to construct a specification theory for Markov Chains. Constraint Markov Chains generalize previously known abstractions by allowing arbitrary constraints on probability distributions. Our theory is the first specification theory for Markov Chains closed under conjunction, parallel composition and synchronization. Moreover, all the operators and Relations introduced are computable.
Ulrik Nyman - One of the best experts on this subject based on the ideXlab platform.
-
Real-time specifications
International Journal on Software Tools for Technology Transfer, 2015Co-Authors: Alexandre David, Kim G. Larsen, Ulrik Nyman, Louis-marie Traonouez, Axel Legay, Andrzej WąsowskiAbstract:A specification theory combines notions of specifications and implementations with a Satisfaction Relation, a refinement Relation, and a set of operators supporting stepwise design. We develop a specification framework for real-time systems using Timed I/O Automata as the specification formalism, with the semantics expressed in terms of Timed I/O Transition Systems. We provide constructs for refinement, consistency checking, logical and structural composition, and quotient of specifications—all indispensable ingredients of a compositional design methodology. The theory is implemented in the new tool Ecdar . We present symbolic versions of the algorithms used in Ecdar , and demonstrate the use of the tool using a small case study in compositional verification.
-
HSCC - Timed I/O automata: a complete specification theory for real-time systems
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control - HSCC '10, 2010Co-Authors: Alexandre David, Kim G. Larsen, Ulrik Nyman, Axel Legay, Andrzej WąsowskiAbstract:A specification theory combines notions of specifications and implementations with a Satisfaction Relation, a refinement Relation and a set of operators supporting stepwise design. We develop a complete specifification framework for real-time systems using Timed I/O Automata as the specification formalism, with the semantics expressed in terms of Timed I/O Transition Systems. We provide constructs for refinement, consistency checking, logical and structural composition, and quotient of specifications --- all indispensable ingredients of a compositional design methodology. The theory is implemented on top of an engine for timed games, Uppaal-tiga, and illustrated with a small case study.
-
timed i o automata a complete specification theory for real time systems
ACM International Conference Hybrid Systems: Computation and Control, 2010Co-Authors: Alexandre David, Kim G. Larsen, Ulrik Nyman, Axel Legay, Andrzej WasowskiAbstract:A specification theory combines notions of specifications and implementations with a Satisfaction Relation, a refinement Relation and a set of operators supporting stepwise design. We develop a complete specifification framework for real-time systems using Timed I/O Automata as the specification formalism, with the semantics expressed in terms of Timed I/O Transition Systems. We provide constructs for refinement, consistency checking, logical and structural composition, and quotient of specifications --- all indispensable ingredients of a compositional design methodology. The theory is implemented on top of an engine for timed games, Uppaal-tiga, and illustrated with a small case study.
