A timed model for communicating sequential processes
From MaRDI portal
Recommendations
Cites work
- A Theory of Communicating Sequential Processes
- Communicating sequential processes
- Connections between two theories of concurrency: Metric spaces and synchronization trees
- scientific article; zbMATH DE number 3902015 (Why is no real title available?)
- scientific article; zbMATH DE number 3902016 (Why is no real title available?)
- scientific article; zbMATH DE number 3902019 (Why is no real title available?)
- scientific article; zbMATH DE number 3926215 (Why is no real title available?)
- scientific article; zbMATH DE number 3956423 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 4050970 (Why is no real title available?)
- scientific article; zbMATH DE number 3658971 (Why is no real title available?)
- scientific article; zbMATH DE number 795666 (Why is no real title available?)
- Processes and the denotational semantics of concurrency
- The expressiveness of CSP with priority
Cited in
(57)- Testing from a stochastic timed system with a fault model
- A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
- The timed failures -- Stability model for CSP
- On performance congruences for process algebras
- Denotational models for programming languages: Applications of Banach's fixed point theorem
- Real space process algebra
- Bisimulation indexes and their applications
- The cones and foci proof technique for timed transition systems
- Timed-pNets: a communication behavioural semantic model for distributed systems
- A branching time model of CSP
- A brief history of process algebra
- Action transducers and timed automata
- Absolute versus relative time in process algebras.
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
- An operational semantics for timed CSP
- Discrete time process algebra
- Checking noninterference in timed CSP
- A process calculus BigrTiMo of mobile systems and its formal semantics
- Sound reasoning in \textit{tock}-CSP
- Translating between models of concurrency
- Laws of mission-based programming
- Specification, testing and implementation relations for symbolic-probabilistic systems
- Safety-critical Java programs from \textsf{Circus} models
- Real time process algebra
- Reactive bisimulation semantics for a process algebra with timeouts
- Timed CSP = closed timed automata
- Simulink timed models for program verification
- On timed models and full abstraction
- Timed process calculi with deterministic or stochastic delays: commuting between durational and durationless actions
- Process algebra and model checking
- Modeling the distributed termination convention of CSP
- Parallel Processes with Real-Time and Data: The ATLANTIF Intermediate Format
- scientific article; zbMATH DE number 4011913 (Why is no real title available?)
- Specifying termination in CSP
- scientific article; zbMATH DE number 1231594 (Why is no real title available?)
- SAT-based verification for timed component connectors
- Timed testing of concurrent systems
- scientific article; zbMATH DE number 2087936 (Why is no real title available?)
- Models for CSP with availability information
- Modeling Long–Running Transactions with Communicating Hierarchical Timed Automata
- Discrete time process algebra with abstraction
- scientific article; zbMATH DE number 7559462 (Why is no real title available?)
- A translation of \(\text{TPAL}_{p}\) into a class of timed-probabilistic Petri nets
- Testing using CSP Models: Time, Inputs, and Outputs
- A hierarchy of domains for real-time distributed computing
- Factorizing proofs in timed CSP
- Axiomatising real-timed processes
- Formal Methods at the Crossroads. From Panacea to Foundational Support
- Metric semantics for true concurrent real time
- An introduction to metric semantics: Operational and denotational models for programming and specification languages
- Discussion on: ``Formal specification method for systems automation
- An overview and synthesis on timed process algebras
- Causal reversibility for timed process calculi with lazy/eager durationless actions and time additivity
- Causal reversibility in nondeterministic process calculi extended with time or probabilities
- Duplication of constants in process algebra
- CPO semantics of timed interactive actor networks
- A process algebraic framework for specification and validation of real-time systems
This page was built for publication: A timed model for communicating sequential processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109561)
