GSOS and finite labelled transition systems

DOI10.1016/0304-3975(94)90094-9zbMath0822.68060MaRDI QIDQ1331924

Luca Aceto

Publication date: 29 August 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90094-9

zbMATH Keywords

labelled transition systems; Plotkin style inference rules

Mathematics Subject Classification ID

68Q55: Semantics in the theory of computing

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

Related Items

Natural Quantum Operational Semantics with Predicates, A format for semantic equivalence comparison, SOS rule formats for idempotent terms and idempotent unary operators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algèbre de processus et synchronisation
• On guarded recursion
• Calculi for synchrony and asynchrony
• Higher-level synchronising devices in Meije-SCCS
• Semantics of systems of concurrent processes. LITP Spring School on theoretical computer science, La Roche Posay, France, 23-27 April 1990. Proceedings
• A calculus of mobile processes. II
• Structured operational semantics and bisimulation as a congruence
• Proving finiteness of CCS processes by non-standard semantics
• Turning SOS rules into equations
• Algebraic laws for nondeterminism and concurrency
• A term model for synchronous processes
• Process Algebra
• Formal verification of parallel programs