• Publications
  • Influence
Hybrid I/O Automata
We propose a new hybrid I/O automaton model that is capable of describing both continuous and discrete behavior. The model, which extends the timed I/O automaton model of [12, 7] and the phaseExpand
  • 567
  • 48
  • PDF
Structured Operational Semantics and Bisimulation as a Congruence
In this paper the question is considered in which cases a transition system specification in Plotkin style has ‘good’ properties and deserves the predicate ‘structured’. The discussion takes place inExpand
  • 409
  • 40
  • PDF
Action versus State based Logics for Transition Systems
  • R. Nicola, F. Vaandrager
  • Mathematics, Computer Science
  • Semantics of Systems of Concurrent Processes
  • 1 November 1990
A temporal logic based on actions rather than on states is presented and interpreted over labelled transition systems. It is proved that it has essentially the same power as CTL*, a temporal logicExpand
  • 351
  • 37
  • PDF
Three logics for branching bisimulation
Three temporal logics are introduced that induce on labeled transition systems the same identifications as branching bisimulation, a behavioral equivalence that aims at ignoring invisible transitionsExpand
  • 317
  • 35
  • PDF
Minimum-Cost Reachability for Priced Timed Automata
This paper introduces the model of linearly priced timed automata as an extension of timed automata, with prices on both transitions and locations. For this model we consider the minimum-costExpand
  • 349
  • 27
  • PDF
The Theory of Timed I/O Automata
This monograph presents the timed input/output automaton (TIOA) modeling framework, a basic mathematical framework to support description and analysis of timed (computing) systems. Timed systems areExpand
  • 233
  • 22
  • PDF
Forward and Backward Simulations: I. Untimed Systems
A unified, comprehensive presentation of simulation techniques for verification of concurrent systems is given, in terms of a simple untimed automaton model. In particular, (1) refinements, (2)Expand
  • 339
  • 21
Linear Parametric Model Checking of Timed Automata
We present an extension of the model checker Uppaal capable of synthesizing linear parameter constraints for the correctness of parametric timed automata. The symbolic representation of theExpand
  • 115
  • 18
Linear Parametric Model Checking of Timed Automata
We present an extension of the model checker UPPAAL capable of synthesize linear parameter constraints for the correctness of parametric timed automata. The symbolic representation of theExpand
  • 112
  • 15
  • PDF
UvA-DARE ( Digital Academic Repository ) Forward and Backward Simulations . Part I : Untimed Systems
A uni ed, comprehensive presentation of simulation techniques for veri cation of concurrent systems is given, in terms of a simple untimed automaton model. In particular, (1) re nements, (2) forwardExpand
  • 212
  • 14
  • PDF