Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems

DOI10.1016/j.entcs.2007.08.016zbMath1278.68142OpenAlexW1999721321MaRDI QIDQ2871829

Heiko Schmidt, Harald Fecher

Publication date: 10 January 2014

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2007.08.016

zbMATH Keywords

process algebraaxiom systemnondeterminismexpansion theorem\(\mu\)-automata

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Refinement Sensitive Formal Semantics of State Machines With Persistent Choice

Uses Software

• LOTOS

Cites Work

• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• Algebra of communicating processes with abstraction
• A calculus of communicating systems
• A brief history of process algebra
• Verfication, model checking, and abstract interpretation. 6th international conference, VMCAI 2005, Paris, France, January 17--19, 2005. Proceedings.
• Alternating-time temporal logic
• Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise
• Automata for the modal μ-calculus and related results
• Bisimulation can't be traced
• Mathematics of Program Construction
• Validation of Stochastic Systems
• Verification, Model Checking, and Abstract Interpretation
• Verification, Model Checking, and Abstract Interpretation
• Underspecification for a simple process algebra of recursive processes.

This page was built for publication: Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems