scientific article; zbMATH DE number 4039251
From MaRDI portal
Publication:3777424
zbMATH Open0637.68007MaRDI QIDQ3777424FDOQ3777424
Authors: Tony Hoare 
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
traceparallel processessequential processesLispinter-process communicationcombination of different devicescomprehension of formal definitionsvariety of events
Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01) Formal languages and automata (68Q45) Abstract data types; algebraic specification (68Q65)
Cited In (only showing first 100 items - show all)
- Quantales, observational logic and process semantics
- On the operating unit size of load/store architectures
- A Theory of Communicating Sequential Processes
- A framework for compositional nonblocking verification of extended finite-state machines
- Modelling and analysing neural networks using a hybrid process algebra
- Automata-theoretic semantics of idealized Algol with passive expressions
- The Birth of Model Checking
- Journeys in non-classical computation I: A grand challenge for computing research
- A CSP model of Eiffel's SCOOP
- CONFLICTS AND FAIR TESTING
- A semantics for behavior trees using CSP with specification commands
- Structural operational semantics through context-dependent behaviour
- Modal logics for mobile processes
- Compositional synthesis of maximally permissive supervisors using supervision equivalence
- A calculus and logic of resources and processes
- SOS formats and meta-theory: 20 years after
- Modeling spiking neural networks
- Computational interpretations of linear logic
- Process algebraic modelling of attentional capture and human electrophysiology in interactive systems
- Nondeterministic fuzzy automata
- Priorities in process algebras
- Observable behavior of dynamic systems: component reasoning for concurrent objects
- Timed process calculi with deterministic or stochastic delays: commuting between durational and durationless actions
- A comparison of semantic models for noninterference
- The neglected pillar of material computation
- GSOS and finite labelled transition systems
- The equational logic of fixed points
- An interpreter for LOTOS, a specification language for distributed systems
- A non-SOS operational semantics for a process algebra
- Quantales, finite observations and strong bisimulation
- The chemical abstract machine
- A calculus of mobile processes. I
- Supervisory control of concurrent discrete-event systems
- Resources, concurrency, and local reasoning
- Sheaf semantics for concurrent interacting objects
- Retracing some paths in process algebra
- A calculus for cryptographic protocols: The spi calculus
- The difference between splitting in \(n\) and \(n+1\)
- Concurrent abstract state machines
- Concurrent Kleene algebra and its foundations
- Full abstraction for PCF
- Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language
- On fluidization of discrete event models: Observation and control of continuous Petri nets
- Synchronous Kleene algebra
- A timed model for communicating sequential processes
- A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
- TIC: a tImed calculus
- The equational theory of pomsets
- A basic algebra of stateless connectors
- Modelling and verifying the AODV routing protocol
- The connection between an event structure semantics and an operational semantics for TCSP
- Rigorous development of component-based systems using component metadata and patterns
- Bisimulation for labelled Markov processes
- EditorArrow: An arrow-based model for editor-based programming
- Reversing algebraic process calculi
- Performance measure sensitive congruences for Markovian process algebras
- Semantics of under-determined expressions
- Timing and causality in process algebra
- A tactic language for refinement of state-rich concurrent specifications
- A hidden agenda
- Systems modelling via resources and processes: philosophy, calculus, semantics, and logic
- Parameter synthesis for hierarchical concurrent real-time systems
- A cylinder computation model for many-core parallel computing
- The behavioural semantics of Event-B refinement
- Transformations of sequential specifications into concurrent specifications by synchronization guards
- Contextual equivalences in configuration structures and reversibility
- Conflict-preserving abstraction of discrete event systems using annotated automata
- Two-thirds simulation indexes and modal logic characterization
- Diagrammatic reasoning for delay-insensitive asynchronous circuits
- Specification of communicating processes: temporal logic versus refusals-based refinement
- Observable behavior of distributed systems: component reasoning for concurrent objects
- Compiling and verifying SC-SystemJ programs for safety-critical reactive systems
- CSP with Hierarchical State
- Processes and games
- A complete modal proof system for HAL: the Herbrand agent language
- Pushdown module checking
- Finite-state concurrent programs can be expressed in pairwise normal form
- A domain equation for bisimulation
- Complete proof systems for weighted modal logic
- A timed process algebra for wireless networks with an application in routing (extended abstract)
- ConGolog, a concurrent programming language based on the situation calculus
- Specification-oriented semantics for communicating processes
- On Communicating Finite-State Machines
- Revisiting interactive Markov chains
- Minimizing the number of transitions with respect to observation equivalence
- Conditional rewriting logic as a unified model of concurrency
- Decentralized supervisory control of discrete-event systems
- On the limits of refinement-testing for model-checking CSP
- Algebraic theory of probabilistic processes.
- Isabelle/UTP: a mechanised theory engineering framework
- Concurrent Kleene Algebra
- Key-ABS: a deductive verification tool for the concurrent modelling language ABS
- A wide-spectrum language for verification of programs on weak memory models
- Automated analysis of mutual exclusion algorithms using CCS
- A theory of stochastic systems. II: Process algebra
- Modelling Divergence in Relational Concurrent Refinement
- Graph rewriting for a partial ordering semantics of concurrent constraints programming
- Deriving graphical representations of process networks from algebraic expressions
- The expressive power of implicit specifications
- Specification techniques for Markov reward models
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777424)
