scientific article
From MaRDI portal
Publication:3121518
zbMath1407.68331arXiv1711.10233MaRDI QIDQ3121518
Marco Peressotti, Tomasz Brengos
Publication date: 18 March 2019
Full work available at URL: https://arxiv.org/abs/1711.10233
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
coalgebraslax functorsgeneral saturationtimed behavioural equivalencetimed language equivalencetimed probabilistic automata
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categories of machines, automata (18B20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Structural operational semantics for stochastic and weighted transition systems
- Structural operational semantics for non-deterministic processes with quantitative aspects
- Bialgebras for structural operational semantics: an introduction
- Probabilistic systems coalgebraically: a survey
- Behavioural equivalences for coalgebras with unobservable moves
- A theory of timed automata
- Time-abstracted bisimulation: Implicit specifications and decidability
- Universal coalgebra: A theory of systems
- Automatic verification of real-time systems with discrete probability distributions.
- An operational semantics for timed CSP
- Relational presheaves, change of base and weak simulation
- Coalgebraic semantics for timed processes
- Strong functors and monoidal monads
- A Coalgebraic View of ε-Transitions
- The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads
- Coalgebraic Trace Semantics for Continuous Probabilistic Transition Systems
- Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems
- Trace Semantics via Determinization
- Weak bisimulation for coalgebras over order enriched monads
- On Coalgebras with Internal Moves
- Relating coalgebraic notions of bisimulation
- Introduction to Bisimulation and Coinduction
- A 2-Categories Companion
- A Categorical View of Timed Weak Bisimulation
- Markov Chains
- Łukasiewicz μ-calculus
- A uniform framework for timed automata
- Coinduction up-to in a fibrational setting
- Generalizing determinization from automata to coalgebras
- A final coalgebra theorem
- Coalgebraic Weak Bisimulation from Recursive Equations over Monads
- Algebra-coalgebra duality in brzozowski's minimization algorithm
- Generic Trace Semantics via Coinduction
- Distributing probability over non-determinism
- An introduction to compositional methods for concurrency and their application to real-time.
