A process algebra for timed systems
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Formal models and analysis of secure multicast in wired and wireless networks
- Revisiting interactive Markov chains
- Discrete time process algebra
- Semantics and expressiveness of ordered SOS
- Algebra of timed frames
- A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
- A process algebra of communicating shared resources with dense time and priorities
- Equational reasonings in wireless network gossip protocols
- A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces
- On convergence-sensitive bisimulation and the embedding of CCS in timed CCS
- Timing and causality in process algebra
- scientific article; zbMATH DE number 1876862 (Why is no real title available?)
- Process algebra with timing
- Timed process calculi with deterministic or stochastic delays: commuting between durational and durationless actions
- A semantic theory of the Internet of Things
- A brief history of Timed CSP
- A probabilistic calculus of cyber-physical systems
- Discrete time generative-reactive probabilistic processes with different advancing speeds
- scientific article; zbMATH DE number 1696898 (Why is no real title available?)
- Raiders of the lost equivalence: probabilistic branching bisimilarity
- ``Closed interval process algebra versus ``interval process algebra
- Fast asynchronous systems in dense time
- Extending timed mobility with probabilities and real-time
- Recursion induction for real-time processes
- Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
- The algebra of timed processes, ATP: Theory and application
- Faster asynchronous systems.
- Repairing time-determinism in the process algebra for hybrid systems
- A timed concurrent constraint language.
- Bisimulation on speed: a unified approach
- scientific article; zbMATH DE number 2113973 (Why is no real title available?)
- A calculus of cyber-physical systems
- Bisimulation indexes and their applications
- Towards an algebra for timed behaviours
- scientific article; zbMATH DE number 1810494 (Why is no real title available?)
- scientific article; zbMATH DE number 140239 (Why is no real title available?)
- Semantic analysis of gossip protocols for wireless sensor networks
- Duplication of constants in process algebra
- Formal Methods for the Design of Real-Time Systems
- A complete axiomatization of timed bisimulation for a class of timed regular behaviours
- Virtually timed ambients: a calculus of nested virtualization
- Absolute versus relative time in process algebras.
- Ordered SOS process languages for branching and eager bisimulations
- Discrete time process algebra and the semantics of SDL
- scientific article; zbMATH DE number 1216183 (Why is no real title available?)
- Decidability and complexity of action-based temporal planning over dense time
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
- The expressive power of monotonic parallel composition
- Formal Methods for the Design of Real-Time Systems
- Embedding untimed into timed process algebra: the case for explicit termination
- Processes, Terms and Cycles: Steps on the Road to Infinity
- scientific article; zbMATH DE number 2086649 (Why is no real title available?)
- Generating priority rewrite systems for OSOS process languages
- Revisiting timing in process algebra.
- Testing Semantics for RTPA
- Executable rewriting logic semantics of Orc and formal analysis of Orc programs
- An algebraic theory of multiple clocks
- A timed calculus for wireless systems
- Process algebras as specification language (work in progress)
- Testing from a stochastic timed system with a fault model
- Real time process algebra
- Process algebra for hybrid systems
- A timed process algebra for wireless networks with an application in routing (extended abstract)
- Behavioural abstraction in TCCS
- An efficiency preorder for processes
- On the semantics of durational actions
- Bisimulation on speed: Lower time bounds
- Bisimulation on speed: Worst-case efficiency
- A timed semantics of Orc
- On performance congruences for process algebras
- Dormancy-aware timed branching bisimilarity with an application to communication protocol analysis
- Sound reasoning in \textit{tock}-CSP
- A process calculus approach to detection and mitigation of PLC malware
- revTPL: The Reversible Temporal Process Language
- Extensions of standard weak bisimulation machinery: finite-state general processes, refinable actions, maximal-progress and time
- scientific article; zbMATH DE number 1231594 (Why is no real title available?)
- A TIMED FAILURE EQUIVALENCE PRESERVING ABSTRACTION FOR PARAMETRIC TIME-INTERVAL AUTOMATA
- Denotational fixed-point semantics for constructive scheduling of synchronous concurrency
- Extending Timed Process Algebra with Discrete Stochastic Time
- Discrete time process algebra with abstraction
- The reversible temporal process language
- Timed testing of concurrent systems
- A linear time process algebra
- An overview and synthesis on timed process algebras
- Timing-Sensitive Noninterference through Composition
- Reactive bisimulation semantics for a process algebra with timeouts
- A real-time process algebra with open intervals and maximal progress
- TPAP: an algebra of preemptive processes for verifying real-time systems with shared resources
- Embedding untimed into timed process algebra; the case for explicit termination
- Real time process algebra with time-dependent conditions
- Modelling mutual exclusion in a process algebra with time-outs
- Causal reversibility for timed process calculi with lazy/eager durationless actions and time additivity
- The expressive power of urgent, lazy and busy-waiting actions in timed processes
- scientific article; zbMATH DE number 2060758 (Why is no real title available?)
- scientific article; zbMATH DE number 2140431 (Why is no real title available?)
- Composition methods for constructing characteristic formulas for dense-time models
- A model of actors and grey failures
- Formal specification and analysis of hardware systems in timed Chi
- CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
- Axiomatizing maximal progress and discrete time
This page was built for publication: A process algebra for timed systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892877)
