Calculi for synchrony and asynchrony

DOI10.1016/0304-3975(83)90114-7zbMath0512.68026OpenAlexW2001748564MaRDI QIDQ1050111

Publication date: 1983

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

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/15158858/Using_Algebra_for_Concurrency_Some_Approaches.pdf

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Theory of operating systems (68N25)

Related Items (only showing first 100 items - show all)

Sound reasoning in \textit{tock}-CSP ⋮ On the expressiveness of choice quantification ⋮ Relating Coalgebraic Notions of Bisimulation ⋮ A hierarchy of domains for real-time distributed computing ⋮ Termination, deadlock and divergence ⋮ Computable processes and bisimulation equivalence ⋮ Testing equivalence as a bisimulation equivalence ⋮ A fully parallel calculus of synchronizing processes ⋮ Compositionality of Hennessy-Milner logic by structural operational semantics ⋮ Branching time and orthogonal bisimulation equivalence ⋮ Compositional Reasoning for Multi-modal Logics ⋮ On the validity of encodings of the synchronous in the asynchronous $\pi$-calculus ⋮ A synchronous $\pi$-calculus ⋮ Extending modal transition systems with structured labels ⋮ Asynchronous communication model based on linear logic ⋮ A domain equation for bisimulation ⋮ Deciding the Bisimilarity Relation between Datalog Goals ⋮ A theory of bisimulation for the $\pi$-calculus ⋮ Event algebra for transition systems composition application to timed automata ⋮ Architectural CCS ⋮ Quantitative analysis of software approximate correctness ⋮ SMT-based generation of symbolic automata ⋮ A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency ⋮ A final coalgebra theorem ⋮ An algebraic framework for developing and maintaining real-time systems ⋮ A Calculus of Countable Broadcasting Systems ⋮ On continuous time agents ⋮ Equivalence checking 40 years after: a review of bisimulation tools ⋮ Comparing the expressiveness of the $\pi $-calculus and CCS ⋮ Unnamed Item ⋮ Enhanced coalgebraic bisimulation ⋮ Decomposing monolithic processes in a process algebra with multi-actions ⋮ A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories ⋮ SOS rule formats for idempotent terms and idempotent unary operators ⋮ Unnamed Item ⋮ Mathematical modal logic: A view of its evolution ⋮ Introducing synchrony in fuzzy automata ⋮ A Notion of Glue Expressiveness for Component-Based Systems ⋮ The expressive power of delay operators in SCCS ⋮ How to Reason Coinductively Informally ⋮ Fairness and regularity for SCCS processes ⋮ On the Semantics of Markov Automata ⋮ Unnamed Item ⋮ Broadcast Calculus Interpreted in CCS upto Bisimulation ⋮ Counting the Cost in the Picalculus (Extended Abstract) ⋮ On Convergence-sensitive Bisimulation and the Embedding of CCS in Timed CCS ⋮ Non-deterministic structures of computation ⋮ On recursive operations over logic LTS ⋮ A functional model for describing and reasoning about time behaviour of computing systems ⋮ A fully abstract denotational model for observational precongruence ⋮ A fully abstract denotational semantics for the calculus of higher-order communicating systems ⋮ Formal specification and analysis of production systems ⋮ Encoding fairness in a synchronous concurrent program algebra ⋮ A brief history of process algebra ⋮ Bisimulation and coinduction enhancements: a historical perspective ⋮ Explicit substitutions for $\pi$-congruences ⋮ Non-regular iterators in process algebra ⋮ Support measures for graph data ⋮ Behavioural abstraction in TCCS ⋮ Asynchronous communication of Petri Nets and the refinement of transitions ⋮ The Expressive Power of Monotonic Parallel Composition ⋮ A linear-time-branching-time spectrum for behavioral specification theories ⋮ Congruent weak bisimulation with dense real-time ⋮ Distributed Synthesis in Continuous Time ⋮ Bialgebraic foundations for the operational semantics of string diagrams ⋮ The expressive power of delay operators in SCCS ⋮ $\mathcal{CL}$ : An Action-Based Logic for Reasoning about Contracts ⋮ Priority as extremal probability ⋮ Probabilistic model of software approximate correctness ⋮ Broadcast Psi-calculi with an Application to Wireless Protocols ⋮ Algebra and logic for resource-based systems modelling ⋮ Deciding bisimulation equivalences for a class of non-finite-state programs ⋮ An efficiency preorder for processes ⋮ Amalgamation of graph transformations: a synchronization mechanism ⋮ Bisimulation of automata ⋮ A categorical framework for typing CCS-style process communication ⋮ Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability ⋮ Abstraction of Clocks in Synchronous Data-Flow Systems ⋮ LANGUAGES FOR REACTIVE SPECIFICATIONS: SYNCHRONY VS ASYNCHRONY ⋮ Final coalgebras and the Hennessy-Milner property ⋮ A Theory Agenda for Component-Based Design ⋮ An algebraic framework for urgency ⋮ On fairness notions in distributed systems. I: A characterization of implementability ⋮ Systems Modelling via Resources and Processes: Philosophy, Calculus, Semantics, and Logic ⋮ An Observational Theory for Mobile Ad Hoc Networks ⋮ Additive models of probabilistic processes ⋮ Model checking for action-based logics ⋮ Declarative event based models of concurrency and refinement in psi-calculi ⋮ Higher-level synchronising devices in Meije-SCCS ⋮ GSOS and finite labelled transition systems ⋮ When is partial trace equivalence adequate? ⋮ Algebraic calculi of processes and net expressions ⋮ About fair asynchrony ⋮ A context dependent equivalence between processes ⋮ Bisimulations and abstraction homomorphisms ⋮ Modeling concurrency with partial orders ⋮ Petri nets, algebras, morphisms, and compositionality ⋮ Infinite streams and finite observations in the semantics of uniform concurrency ⋮ Processes with probabilities, priority and time ⋮ Automatizing parametric reasoning on distributed concurrent systems

Cites Work

This page was built for publication: Calculi for synchrony and asynchrony