CIRCAL and the representation of communication, concurrency, and time
From MaRDI portal
Publication:3675511
DOI10.1145/3318.3322zbMath0562.68017OpenAlexW2085912345MaRDI 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/
communicationsynchronyconcurrent systemscorrectnessoperational semanticsasynchronyacceptance semanticsCIRCAL calculus
Related Items
An exercise in the automatic verification of asynchronous designs, Automatizing parametric reasoning on distributed concurrent systems, Step bisimulation is pomset equivalence on a parallel language without explicit internal choice, Partial ordering models for concurrency can be defined operationally, Discrete time process algebra, An algebraic framework for developing and maintaining real-time systems, TTL: A modular language for hardware/software systems design., Equivalence checking 40 years after: a review of bisimulation tools, A partial ordering semantics for CCS, The equivalence in the DCP model, Specification styles in distributed systems design and verification, Concurrent regular expressions and their relationship to Petri nets, Automatic verification of distributed systems: the process algebra approach., Step failures semantics and a complete proof system, TIC: a tImed calculus, LOTOS extended with probabilistic behaviours, Action transducers and timed automata, A general theory of action languages, On fairness notions in distributed systems. I: A characterization of implementability, Modelling Dynamically Changing Hardware Structure, Reflections on the Future of Concurrency Theory in General and Process Calculi in Particular
