Behavioural equivalences for timed systems
From MaRDI portal
Recommendations
- Unifying behavioral equivalences of timed transition systems
- A categorical view of timed behaviours
- Timed delay bisimulation is an equivalence relation for timed transition systems
- A uniform framework for timed automata
- Timed transition systems with independence and timed event structures: an adjunction
Cites work
- A 2-categories companion
- A categorical view of timed weak bisimulation
- A coalgebraic take on regular and \(\omega\)-regular behaviour for systems with internal moves
- A coalgebraic view of -transitions
- A final coalgebra theorem
- A theory of timed automata
- A uniform framework for timed automata
- Algebra-coalgebra duality in Brzozowski's minimization algorithm
- An introduction to compositional methods for concurrency and their application to real-time.
- An operational semantics for timed CSP
- Automatic verification of real-time systems with discrete probability distributions.
- Behavioural equivalences for coalgebras with unobservable moves
- Bialgebras for structural operational semantics: an introduction
- Coalgebraic semantics for timed processes
- Coalgebraic trace semantics for combined possibilitistic and probabilistic systems
- Coalgebraic trace semantics for continuous probabilistic transition systems
- Coalgebraic Weak Bisimulation from Recursive Equations over Monads
- Coinduction up-to in a fibrational setting
- Distributing probability over non-determinism
- Generalizing determinization from automata to coalgebras
- Generic Trace Semantics via Coinduction
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1358710 (Why is no real title available?)
- scientific article; zbMATH DE number 2086649 (Why is no real title available?)
- scientific article; zbMATH DE number 896756 (Why is no real title available?)
- Introduction to bisimulation and coinduction
- Markov Chains
- On coalgebras with internal moves
- Probabilistic systems coalgebraically: a survey
- Relating coalgebraic notions of bisimulation
- Relational presheaves, change of base and weak simulation
- Strong functors and monoidal monads
- Structural operational semantics for non-deterministic processes with quantitative aspects
- Structural operational semantics for stochastic and weighted transition systems
- The category theoretic understanding of universal algebra: Lawvere theories and monads
- Time-abstracted bisimulation: Implicit specifications and decidability
- Trace semantics via determinization
- Universal coalgebra: A theory of systems
- Weak bisimulation for coalgebras over order enriched monads
- Łukasiewicz \(\mu\)-calculus
Cited in
(7)- Unifying behavioral equivalences of timed transition systems
- Symbolic timed trace equivalence
- A uniform framework for timed automata
- A coalgebraic take on regular and -regular behaviours
- scientific article; zbMATH DE number 6261993 (Why is no real title available?)
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Equivalence between time consistency and nested formula
This page was built for publication: Behavioural equivalences for timed systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3121518)
