Communicating sequential processes
Communicating sequential processes
Introduction to the ISO specification language LOTOS
Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
Journal of the ACM (JACM)
Algebraic approaches to nondeterminism—an overview
ACM Computing Surveys (CSUR)
Underspecification for a simple process algebra of recursive processes
Theoretical Computer Science
Alternating-time temporal logic
Journal of the ACM (JACM)
Automata for the Modal mu-Calculus and related Results
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Possible Worlds for Process Algebras
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Process Algebra with Partial Choice
CONCUR '94 Proceedings of the Concurrency Theory
On the Composition of Hybrid Systems
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
Three-Valued Abstractions of Games: Uncertainty, but with Precision
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
A brief history of process algebra
Theoretical Computer Science - Process algebra
3-Valued Abstraction: More Precision at Less Cost
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Ranked predicate abstraction for branching time: complete, incremental, and precise
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Refinement Sensitive Formal Semantics of State Machines With Persistent Choice
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Process algebras are standard formalisms for compositionally describing systems by the dependencies of their observable synchronous communication. In concurrent systems, parallel composition introduces resolvable nondeterminism, i.e., nondeterminism that will be resolved in later design phases or by the operating system. Sometimes it is also important to express inherent nondeterminism for equal (communication) labels. Here, we give operational and axiomatic semantics to a process algebra having a parallel operator interpreted as concurrent and having a choice operator interpreted as inherent, not only w.r.t. different, but also w.r.t. equal next-step actions. In order to handle the different kinds of nondeterminism, the operational semantics uses @m-automata as underlying semantical model. Soundness and completeness of our axiom system w.r.t. the operational semantics is shown.