CIRCAL and the representation of communication, concurrency, and time
From MaRDI portal
Publication:3675511
DOI10.1145/3318.3322zbMath0562.68017MaRDI QIDQ3675511
Publication date: 1985
Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/toplas/1985-7/
communication; synchrony; concurrent systems; correctness; operational semantics; asynchrony; acceptance semantics; CIRCAL calculus
68N25: Theory of operating systems
Related Items
Step bisimulation is pomset equivalence on a parallel language without explicit internal choice, Step failures semantics and a complete proof system, A partial ordering semantics for CCS, Automatic verification of distributed systems: the process algebra approach., Partial ordering models for concurrency can be defined operationally, The equivalence in the DCP model, Specification styles in distributed systems design and verification, Concurrent regular expressions and their relationship to Petri nets, TIC: a tImed calculus, LOTOS extended with probabilistic behaviours, A general theory of action languages, An exercise in the automatic verification of asynchronous designs, Automatizing parametric reasoning on distributed concurrent systems, TTL: A modular language for hardware/software systems design., Action transducers and timed automata, On fairness notions in distributed systems. I: A characterization of implementability, Discrete time process algebra
