Deriving Syntax and Axioms for Quantitative Regular Behaviours

DOI10.1007/978-3-642-04081-8_11MaRDI QIDQ3184671zbMATH OpenOpenAlexFDO

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

Publication date 22 October 2009

Published in CONCUR 2009 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04081-8_11

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Abstract data types; algebraic specification (68Q65) Algebraic theory of languages and automata (68Q70)

Recommendations

• Quantitative Kleene coalgebras
• A coalgebraic perspective on linear weighted automata
• Non-deterministic Kleene coalgebras
• Sound and complete axiomatizations of coalgebraic language equivalence
• Weighted automata and regular expressions over valuation monoids

Cites work

• A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages
• A complete inference system for a class of regular behaviours
• A hierarchy of probabilistic system types
• A Kleene Theorem for Polynomial Coalgebras
• A logic for reasoning about time and reliability
• Automata, Languages and Programming
• Axioms for probability and nondeterminism
• Bisimulation relations for weighted automata
• Bisimulation through probabilistic testing
• CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
• CONCUR '92. 3rd international conference on concurrency theory. Stony Brook, NY, USA, August 24--27, 1992. Proceedings
• Derivatives of Regular Expressions
• Deriving Syntax and Axioms for Quantitative Regular Behaviours
• Equational axioms for probabilistic bisimilarity
• Foundations of Software Science and Computational Structures
• scientific article; zbMATH DE number 1497872 (Why is no real title available?)
• scientific article; zbMATH DE number 1754605 (Why is no real title available?)
• scientific article; zbMATH DE number 1884420 (Why is no real title available?)
• scientific article; zbMATH DE number 794262 (Why is no real title available?)
• Many-sorted coalgebraic modal logic: A model-theoretic study
• Monoid-labeled transition systems
• On the definition of a family of automata
• Priority as extremal probability
• Probabilistic automata
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Reactive, generative, and stratified models of probabilistic processes
• Two Complete Axiom Systems for the Algebra of Regular Events
• Universal coalgebra: A theory of systems
• Verification of multiprocess probabilistic protocols

Cited in

(5)

• Complete axiomatization for the total variation distance of Markov chains
• Non-deterministic Kleene coalgebras
• Deriving Syntax and Axioms for Quantitative Regular Behaviours
• Quantitative Kleene coalgebras
• A semiring-based trace semantics for processes with applications to information leakage analysis

This page was built for publication: Deriving Syntax and Axioms for Quantitative Regular Behaviours

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3184671)