Sciweavers

CAV
1994
Springer
113views Hardware» more  CAV 1994»
13 years 8 months ago
A Determinizable Class of Timed Automata
We introduce event-recording automata. An event-recording automaton is a timed automaton that contains, for every event a, a clock that records the time of the last occurrence of a...
Rajeev Alur, Limor Fix, Thomas A. Henzinger
CONCUR
1998
Springer
13 years 8 months ago
Alternating Refinement Relations
Alternating transition systems are a general model for composite systems which allow the study of collaborative as well as adversarial relationships between individual system compo...
Rajeev Alur, Thomas A. Henzinger, Orna Kupferman, ...
STACS
2001
Springer
13 years 9 months ago
Semantical Principles in the Modal Logic of Coalgebras
Coalgebras for a functor on the category of sets subsume many formulations of the notion of transition system, including labelled transition systems, Kripke models, Kripke frames a...
Dirk Pattinson
CONCUR
2001
Springer
13 years 9 months ago
On the Power of Labels in Transition Systems
Abstract. In this paper we discuss the role of labels in transition systems with regard to bisimilarity and model checking problems. We suggest a general reduction from labelled tr...
Jirí Srba
CONCUR
2009
Springer
13 years 9 months ago
Bigraphical Categories
ract bigraphs lack RPOs 57 6 Sorting 59 6.1 Place sorting and CCS 59 6.2 Link sorting, arithmetic nets and Petri nets 64 6.3 The impact of sorting 69 Part II : Motion 71 7 Reaction...
Robin Milner
LICS
2002
IEEE
13 years 9 months ago
Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing
istic Abstraction for Model Checking: an Approach Based on Property Testing∗ Sophie Laplante† Richard Lassaigne‡ Fr´ed´eric Magniez§ Sylvain Peyronnet† Michel de Rougemo...
Sophie Laplante, Richard Lassaigne, Fréd&ea...
BIRTHDAY
2003
Springer
13 years 9 months ago
Petri Net Analysis Using Invariant Generation
Abstract. Petri nets have been widely used to model and analyze concurrent systems. Their wide-spread use in this domain is, on one hand, facilitated by their simplicity and expres...
Sriram Sankaranarayanan, Henny Sipma, Zohar Manna
FOSSACS
2005
Springer
13 years 10 months ago
Duality for Logics of Transition Systems
We present a general framework for logics of transition systems based on Stone duality. Transition systems are modelled as coalgebras for a functor T on a category X. The propositi...
Marcello M. Bonsangue, Alexander Kurz
IV
2005
IEEE
76views Visualization» more  IV 2005»
13 years 10 months ago
Multidimensional Visualization of Transition Systems
Transition systems are graphs and it is natural to consider their visual representation as a graph visualization problem. They also pose an interesting multidimensional visualizat...
A. Johannes Pretorius, Jarke J. van Wijk
LICS
2006
IEEE
13 years 10 months ago
Saturated Semantics for Reactive Systems
The semantics of process calculi has traditionally been specified by labelled transition systems (LTS), but with the development of name calculi it turned out that reaction rules...
Filippo Bonchi, Barbara König, Ugo Montanari