A compositional proof system on a category of labelled transition systems

DOI10.1016/0890-5401(90)90058-PzbMath0719.68010OpenAlexW2001587236MaRDI QIDQ2640340

Glynn Winskel

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0890-5401(90)90058-p

zbMATH Keywords

concurrencycompositional proof systemscategory of labelled transition systemscategory-theoretic language

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) General topics in the theory of software (68N01)

Related Items (7)

Sheaf semantics for concurrent interacting objects ⋮ A characterization of set representable labeled partial 2-structures through decompositions ⋮ A formal verification technique for behavioural model-to-model transformations ⋮ An algebraic semantics for structured transition systems and its application to logic programs ⋮ Comprehension categories and the semantics of type dependency ⋮ A coalgebraic presentation of structured transition systems ⋮ Compositional minimisation of finite state systems using interface specifications

Cites Work

• Results on the propositional \(\mu\)-calculus
• Modeling concurrency with partial orders
• Petri nets, algebras, morphisms, and compositionality
• A calculus of communicating systems
• Fibered categories and the foundations of naive category theory
• A Theory of Communicating Sequential Processes
• 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

This page was built for publication: A compositional proof system on a category of labelled transition systems