References¶
[ACFV2005] | Luca Aceto, Wan Fokkink, Chris Verhoef; Structural Operational Semantics, Vrije Universiteit Amsterdam. |
[CHOM1957] | Noam Chomsky; Syntactics Structures; 1957, Mouton de Gruyter. |
[CODV2001] | F. Corradini, M. Di Berardini, W. Vogler; PAFAS at Work: Comparing the Worst-Case Efficiency of Three Buffer Implementations; 2001, Proceedings of the Second Asia-Pacific Conference on Quality Software. |
[GASP1977] | Ida Cattaneo Gasparini; Strutture algebriche, operatori lineari; 1977, Libreria Eredi Virgilio Veschi. |
[HENN2008] | Matthew Hennessy; Reactive Systems: How to use the Concurrency Workbench; 2008, Trinity College Dublin, The University of Dublin. |
[MILN1989] | Robin Milner; Communication and concurrency; 1989, Prentice Hall. |
[PLOT1981] | G. D. Plotkin; A structural Approach to Operational Semantics, University of Aarhus, Denmark. |
[SANR2011] | Davide Sangiorgi, Jan Rutten; Advanced Topics in Bisimulation and Coinduction; 2011, Cambridge University Press. |
[SAKH2019a] | Sakharov, Alex: regular expressions from MathWorld–A Wolfram Web Resource, created by Eric W. Weisstein. |
[SAKH2019b] | Sakharov, Alex: Formal Language from MathWorld–A Wolfram Web Resource, created by Eric W. Weisstein. |
[SLKU1995] | Kenneth Slonneger, Barry L. Kurtz; Formal Syntax and Semantics of Programming Languages - A Laboratory Based Approach; 1995, Addison-Wesley Publishing Company. |
[WIKI2019a] | Wikipedia deterministic finite automaton. |
[WIKI2019b] | Wikipedia nondeterministic finite automaton. |
[WIKI2019c] | Wikipedia Semantics (computer science). |
[WIKI2019d] | Wikipedia Axiomatic semantics. |
[WIKI2019e] | Wikipedia Denotational_semantics. |
[WIKI2019f] | Wikipedia Operational_semantics. |
[WIKI2019g] | Wikipedia Structural operational semantics link. |
[WIKI2019h] | Wikipedia Natural semantics. |
[EDIS1998] | Tom Verhoeff; Encyclopaedia of Delay-Insensitive Systems: RGDA Arbiter; nov. 1998. |
[SABL1994] | Ken Stevens, John Aldwinckle, Graham Birtwistle, Ying Liu; Designing parallel specifications in CCS;
|
[LABS1993] | Ying Liu, John Aldwinckle, Graham Birtwistle, and Ken Stevens. Testing the Consequences of Specifications in the Modal-mu Calculus; Canadian Conference on Electrical and Computer Engineering Vol II pp 987-990, September 1993. |
Abbreviations and terms¶
Term | Note |
---|---|
ACP | Algebra of communicating Processes |
\(Alph\) | Alphabet |
BC | Buffer Controller |
BNF | Backus-Naur Form [SLKU1995] pag.3 |
BPMN | Business Process Model and Notation |
CCS | a Calculus of Communicating Systems |
CSP | Communicating Sequential Processes |
CWB | edinburgh Concurrency WorkBench |
CWB-NC | Concurrency WorkBench of the New Century |
dhcp | Dynamic Host Configuration Protocol |
eof | End Of Life |
FIFO | First In First Out |
MS | Microsoft |
LTE | Labeled Transition System |
LOTOS | Language Of Temporal Ordering Specification |
R.E. | Regular Expression |
RGDA | Request Grant Done Acknowledge arbiter [EDIS1998] |
SCCS | Synchronous Calculus of Communicating Systems [MILN1989] |
SOS | Structural Operational Semantics [ACFV2005], [PLOT1981] |
TCCS | a Temporal Calculus of Communicating Systems |
VM | Virtual Machine |