We propose behavioral specification theories for most equivalences in the linear-time--branching-time spectrum. Almost all previous work on specification theories focuses on bisimilarity, but there is a clear interest in specification theories for other preorders and equivalences. We show that specification theories for preorders cannot exist and develop a general scheme which allows us to define behavioral specification theories, based on disjunctive modal transition systems, for most equivalences in the linear-time--branching-time spectrum
This paper explores the connection between semantic equivalences and preorders for concrete sequenti...
This paper explores the connection between semantic equivalences and preorders for concrete sequenti...
We provide a unifying view of timed models such as timed automata, probabilistic timed automata, and...
We propose behavioral specification theories for most equivalences in the linear-time–branching-time...
We propose behavioral specification theories for most equivalences in the linear-time–branching-time...
Timed transition systems are a widely studied model for real-time systems. The intention of the pape...
AbstractThere have been quite a few proposals for behavioural equivalences for concurrent processes,...
Van Glabbeek's linear time-branching time spectrum is one of the mostrelevant work on comparative st...
Timed transition systems are behavioural models that include an explicittreatment of time flow and a...
A method is described for proving “always possibly ” properties of specifications in formalisms with...
Abstract. The discussion in the computer-science literature of the relative merits of linear- versus...
Two main areas of temporal logics are those of linear time and of branching time. Linear orders, tho...
We introduce a generalization of the bisimulation game that findsdistinguishing Hennessy-Milner logi...
Behavioral equivalences were introduced as a simple and elegant proof methodology for establishing w...
This paper explores the connection between semantic equivalences and preorders for concrete sequenti...
This paper explores the connection between semantic equivalences and preorders for concrete sequenti...
This paper explores the connection between semantic equivalences and preorders for concrete sequenti...
We provide a unifying view of timed models such as timed automata, probabilistic timed automata, and...
We propose behavioral specification theories for most equivalences in the linear-time–branching-time...
We propose behavioral specification theories for most equivalences in the linear-time–branching-time...
Timed transition systems are a widely studied model for real-time systems. The intention of the pape...
AbstractThere have been quite a few proposals for behavioural equivalences for concurrent processes,...
Van Glabbeek's linear time-branching time spectrum is one of the mostrelevant work on comparative st...
Timed transition systems are behavioural models that include an explicittreatment of time flow and a...
A method is described for proving “always possibly ” properties of specifications in formalisms with...
Abstract. The discussion in the computer-science literature of the relative merits of linear- versus...
Two main areas of temporal logics are those of linear time and of branching time. Linear orders, tho...
We introduce a generalization of the bisimulation game that findsdistinguishing Hennessy-Milner logi...
Behavioral equivalences were introduced as a simple and elegant proof methodology for establishing w...
This paper explores the connection between semantic equivalences and preorders for concrete sequenti...
This paper explores the connection between semantic equivalences and preorders for concrete sequenti...
This paper explores the connection between semantic equivalences and preorders for concrete sequenti...
We provide a unifying view of timed models such as timed automata, probabilistic timed automata, and...