Quantitative Kleene coalgebras

DOI10.1016/J.IC.2010.09.007zbMath1227.68075OpenAlexW2137891929MaRDI QIDQ532394

Alexandra Silva, Filippo Bonchi, Marcello M. Bonsangue, Jan J. M. M. Rutten

Publication date: 4 May 2011

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1822/34436

zbMATH Keywords

coalgebraweighted automatacomplete axiomatizationprobabilistic systemsregular expressionKleene's theorem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (10)

Complete axiomatization for the total variation distance of Markov chains ⋮ Manipulation of regular expressions using derivatives: an overview ⋮ Towards a linear algebra of programming ⋮ Towards general axiomatizations for bisimilarity and trace semantics ⋮ WEIGHTED AUTOMATA AS COALGEBRAS IN CATEGORIES OF MATRICES ⋮ Sound and Complete Axiomatization of Trace Semantics for Probabilistic Systems ⋮ Unnamed Item ⋮ Predicate liftings and functor presentations in coalgebraic expression languages ⋮ A New Foundation for Finitary Corecursion ⋮ A new foundation for finitary corecursion and iterative algebras

Uses Software

• CIRC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hierarchy of probabilistic system types
• CONCUR 2009 -- concurrency theory. 20th international conference, CONCUR 2009, Bologna, Italy, September 1--4, 2009. Proceedings
• A complete inference system for a class of regular behaviours
• Bisimulation through probabilistic testing
• CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
• A logic for reasoning about time and reliability
• Universal coalgebra: A theory of systems
• Products of coalgebras.
• Probabilistic verification
• Priority as extremal probability
• Reactive, generative, and stratified models of probabilistic processes
• Bisimulation relations for weighted automata
• Approximating and computing behavioural distances in probabilistic transition systems
• CIRC: A Behavioral Verification Tool Based on Circular Coinduction
• Equational Axioms for Probabilistic Bisimilarity
• Deriving Syntax and Axioms for Quantitative Regular Behaviours
• Weighted Bisimulation in Linear Algebraic Form
• Structural Operational Semantics for Weighted Transition Systems
• On the definition of a family of automata
• Coalgebraic Foundations of Linear Systems
• On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces
• Coalgebras of bounded type
• Monoid-labeled transition systems
• Formal verification of timed properties of randomized distributed algorithms
• Coalgebraic Logic and Synthesis of Mealy Machines
• Two Complete Axiom Systems for the Algebra of Regular Events
• Probabilistic automata
• Derivatives of Regular Expressions
• Foundations of Software Science and Computational Structures
• Automata, Languages and Programming
• Processes, Terms and Cycles: Steps on the Road to Infinity

This page was built for publication: Quantitative Kleene coalgebras