Process algebra with timing
From MaRDI portal
Publication:1847280
zbMATH Open1021.68063MaRDI QIDQ1847280FDOQ1847280
Authors: C. A. Middelburg, Jos C. M. Baeten 
Publication date: 17 November 2002
Published in: Monographs in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (51)
- Lost in Translation: Hybrid-Time Flows vs. Real-Time Transitions
- Bisimulation on speed: a unified approach
- Revisiting timing in process algebra.
- Process algebra with strategic interleaving
- Title not available (Why is that?)
- Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic?
- Title not available (Why is that?)
- Fixing Zeno gaps
- SOS rule formats for zero and unit elements
- SOS formats and meta-theory: 20 years after
- An algebra of hybrid systems
- Process algebraic modelling of attentional capture and human electrophysiology in interactive systems
- Dormancy-aware timed branching bisimilarity with an application to communication protocol analysis
- A translation of \(\text{TPAL}_{p}\) into a class of timed-probabilistic Petri nets
- Model-based engineering of embedded systems using the hybrid process algebra Chi
- Service oriented computing from a process algebraic perspective
- Title not available (Why is that?)
- SAT-based verification for timed component connectors
- Rule formats for determinism and idempotence
- Duplication of constants in process algebra
- Extending Timed Process Algebra with Discrete Stochastic Time
- Repairing time-determinism in the process algebra for hybrid systems
- Hybrid process algebra
- Process algebra for hybrid systems
- A process calculus with finitary comprehended terms
- Axiomatizing maximal progress and discrete time
- An algebraic theory of multiple clocks
- On rule formats for zero and unit elements
- The algebra of timed processes, ATP: Theory and application
- Syntax and consistent equation semantics of hybrid Chi
- An alternative formulation of operational conservativity with binding terms.
- Notions of bisimulation and congruence formats for SOS with data
- Title not available (Why is that?)
- A brief history of process algebra
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
- Symbolic timing devices
- Continuity controlled hybrid automata
- A barred operational semantics for a subset of WS-CDL with time restrictions
- Virtually timed ambients: a calculus of nested virtualization
- Algebra of timed frames
- Formal Methods for the Design of Real-Time Systems
- Title not available (Why is that?)
- Suitability of mCRL2 for concurrent-system design: a \(2 \times 2\) Switch case study
- Executable rewriting logic semantics of Orc and formal analysis of Orc programs
- A timed calculus for wireless systems
- Real time process algebra
- Discrete time process algebra with abstraction
- Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption
- Title not available (Why is that?)
- Modeling time in computing.
- Specification, testing and implementation relations for symbolic-probabilistic systems
This page was built for publication: Process algebra with timing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1847280)
