Sciweavers

Share
POPL
2012
ACM
8 years 3 months ago
The marriage of bisimulations and Kripke logical relations
There has been great progress in recent years on developing effective techniques for reasoning about program equivalence in ML-like languages—that is, languages that combine fea...
Chung-Kil Hur, Derek Dreyer, Georg Neis, Viktor Va...
FOSSACS
2012
Springer
8 years 3 months ago
A Coalgebraic Perspective on Minimization and Determinization
Coalgebra offers a unified theory of state based systems, including infinite streams, labelled transition systems and deterministic automata. In this paper, we use the coalgebrai...
Jirí Adámek, Filippo Bonchi, Mathias...
FOSSACS
2011
Springer
8 years 11 months ago
Similarity Quotients as Final Coalgebras
We give a general framework connecing a branching time relation on nodes of a transition system to a final coalgebra for a suitable endofunctor. Examples of relations treated by o...
Paul Blain Levy
JLP
2010
105views more  JLP 2010»
9 years 3 months ago
Quantitative analysis of weighted transition systems
We present a general framework for the analysis of quantitative and qualitative properties of reactive systems, based on a notion of weighted transition systems. We introduce and ...
Claus R. Thrane, Uli Fahrenberg, Kim G. Larsen
IANDC
2011
119views more  IANDC 2011»
9 years 3 months ago
Quantitative Kleene coalgebras
We present a systematic way to generate (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of quantitative ...
Alexandra Silva, Filippo Bonchi, Marcello M. Bonsa...
IANDC
2011
127views more  IANDC 2011»
9 years 3 months ago
On the consistency, expressiveness, and precision of partial modeling formalisms
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...
Ou Wei, Arie Gurfinkel, Marsha Chechik
BIRTHDAY
2009
Springer
9 years 6 months ago
Structural Operational Semantics for Weighted Transition Systems
Weighted transition systems are defined, parametrized by a commutative monoid of weights. These systems are further understood as coalgebras for functors of a specific form. A gene...
Bartek Klin
TGC
2010
Springer
9 years 6 months ago
Uniform Labeled Transition Systems for Nondeterministic, Probabilistic, and Stochastic Processes
Rate transition systems (RTS) are a special kind of transition systems introduced for defining the stochastic behavior of processes and for associating continuous-time Markov chain...
Marco Bernardo, Rocco De Nicola, Michele Loreti
SIGSOFT
2010
ACM
9 years 6 months ago
From requirements to partial behavior models: an iterative approach to incremental specification refinement
In this thesis, I will improve the state-of-the-art for capturing, analyzing, and refining functional requirements by providing support for synthesizing, analyzing, and refining M...
Ivo Krka
ACSD
2010
IEEE
197views Hardware» more  ACSD 2010»
9 years 6 months ago
Order-Independence of Vector-Based Transition Systems
Abstract--Semantics of many specification languages, particularly those used in the domain of hardware, is described in terms of vector-based transition systems. In such a transiti...
Matthias Raffelsieper, Mohammad Reza Mousavi, Hans...
books