Finitely Branching Labelled Transition Systems from Reaction Semantics for Process Calculi

DOI10.1007/978-3-642-03429-9_9MaRDI QIDQ3184728zbMATH OpenOpenAlexFDO

Authors Pietro Di Gianantonio, Furio Honsell, Marina Lenisa

Publication date 22 October 2009

Published in Recent Trends in Algebraic Development Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03429-9_9

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Efficient Bisimilarities from Second-Order Reaction Semantics for π-Calculus
• scientific article; zbMATH DE number 1759615
• Deriving labelled transition systems -- a structural approach
• Deriving bisimulation congruences: a 2-categorical approach
• Reactive systems, (semi-)saturated semantics and coalgebras on presheaves

Cites work

• A well-behaved LTS for the pi-calculus (abstract)
• Bigraphs and transitions
• Foundations of Software Science and Computational Structures
• scientific article; zbMATH DE number 2059571 (Why is no real title available?)
• scientific article; zbMATH DE number 1759615 (Why is no real title available?)
• Process Bisimulation Via a Graphical Encoding
• Processes, Terms and Cycles: Steps on the Road to Infinity
• RPO, Second-Order Contexts, and λ-Calculus

Cited in

(4)

• Branch-well-structured transition systems and extensions
• Deriving labelled transition systems -- a structural approach
• scientific article; zbMATH DE number 557977 (Why is no real title available?)
• A Compositional Semantics of Reaction Systems with Restriction

This page was built for publication: Finitely Branching Labelled Transition Systems from Reaction Semantics for Process Calculi

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