Bialgebraic methods and modal logic in structural operational semantics
From MaRDI portal
Publication:1012126
DOI10.1016/j.ic.2007.10.006zbMath1165.68043OpenAlexW2100996925MaRDI QIDQ1012126
Publication date: 14 April 2009
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2007.10.006
Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)
Related Items (12)
Towards Bialgebraic Semantics for the Linear Time – Branching Time Spectrum ⋮ Unnamed Item ⋮ Structural Operational Semantics for Weighted Transition Systems ⋮ Structural Operational Semantics and Modal Logic, Revisited ⋮ Smooth coalgebra: testing vector analysis ⋮ Bialgebras for structural operational semantics: an introduction ⋮ Traces for coalgebraic components ⋮ Pointwise extensions of GSOS-defined operations ⋮ Structural operational semantics for non-deterministic processes with quantitative aspects ⋮ Towards Effects in Mathematical Operational Semantics ⋮ Coalgebraic logics \& duality ⋮ Bialgebraic methods and modal logic in structural operational semantics
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new approach to abstract syntax with variable binding
- Category theory for operational semantics
- A congruence rule format for name-passing process calculi
- Bialgebraic methods and modal logic in structural operational semantics
- Higher-level synchronising devices in Meije-SCCS
- Coalgebraic logic
- Universal coalgebra: A theory of systems
- Compositional SOS and beyond: A coalgebraic view of open systems
- Adding recursive constructs to bialgebraic semantics
- Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS
- A spatial logic for concurrency. I
- \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
- Distributive laws for the coinductive solution of recursive equations
- Coalgebraic semantics for timed processes
- Introduction to Coalgebra
- Rule Formats for Timed Processes
- GSOS for probabilistic transition systems
- Testing Semantics: Connecting Processes and Process Logics
- Algebraic laws for nondeterminism and concurrency
- Bisimulation can't be traced
- A final coalgebra theorem
- Coalgebraic Modal Logic Beyond Sets
- Precongruence formats for decorated trace semantics
- Foundations of Software Science and Computational Structures
- Foundations of Software Science and Computational Structures
- Foundations of Software Science and Computation Structures
- CONCUR 2003 - Concurrency Theory
- Fundamentals of Computation Theory
This page was built for publication: Bialgebraic methods and modal logic in structural operational semantics