Real time process algebra
From MaRDI portal
Publication:2640341
DOI10.1007/BF01898401zbMath0719.68020OpenAlexW2138549619MaRDI QIDQ2640341
Jos C. M. Baeten, Jan A. Bergstra
Publication date: 1991
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01898401
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Abstract data types; algebraic specification (68Q65)
Related Items
On the expressiveness of choice quantification ⋮ Real space process algebra ⋮ Recursion induction for real-time processes ⋮ Process algebra with guards: Combining hoare logic with process algebra ⋮ Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation ⋮ Computable processes and bisimulation equivalence ⋮ Axiomatising real-timed processes ⋮ Timed process calculi with deterministic or stochastic delays: commuting between durational and durationless actions ⋮ Continuity controlled hybrid automata ⋮ Process Algebra and Model Checking ⋮ Discrete time process algebra with abstraction ⋮ Duplication of constants in process algebra ⋮ Discrete time process algebra ⋮ Bisimulation on speed: Worst-case efficiency ⋮ A complete axiomatization of finite-state ACSR processes ⋮ Compositional verification of real-time systems with explicit clock temporal logic ⋮ SOS formats and meta-theory: 20 years after ⋮ Timing and causality in process algebra ⋮ A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time ⋮ An algebraic framework for developing and maintaining real-time systems ⋮ A process algebra of communicating shared resources with dense time and priorities ⋮ Virtually timed ambients: a calculus of nested virtualization ⋮ A general conservative extension theorem in process algebras with inequalities ⋮ Process algebra with language matching ⋮ Revisiting timing in process algebra. ⋮ An alternative formulation of operational conservativity with binding terms. ⋮ revTPL: The Reversible Temporal Process Language ⋮ Unnamed Item ⋮ A timed calculus for wireless systems ⋮ Unnamed Item ⋮ Generalizing finiteness conditions of labelled transition systems ⋮ A complete axiomatization of timed bisimulation for a class of timed regular behaviours ⋮ A theory of processes with durational actions ⋮ A brief history of Timed CSP ⋮ Variable binding operators in transition system specifications ⋮ An introduction to metric semantics: Operational and denotational models for programming and specification languages ⋮ Real time process algebra with time-dependent conditions ⋮ A brief history of process algebra ⋮ Process algebra for hybrid systems ⋮ Process algebra for performance evaluation ⋮ On the semantics of durational actions ⋮ Models and languages for description of parallel processes ⋮ Behavioural abstraction in TCCS ⋮ Congruent weak bisimulation with dense real-time ⋮ TIC: a tImed calculus ⋮ Action transducers and timed automata ⋮ A conservative look at operational semantics with variable binding ⋮ On performance congruences for process algebras ⋮ TPAP ⋮ Refinement of time ⋮ Absolute versus relative time in process algebras. ⋮ A timed concurrent constraint language. ⋮ Executable rewriting logic semantics of Orc and formal analysis of Orc programs ⋮ Bisimulation indexes and their applications ⋮ The cones and foci proof technique for timed transition systems
Cites Work
- On the consistency of Koomen's fair abstraction rule
- A timed model for communicating sequential processes
- Compositional semantics for real-time distributed computing
- A calculus of communicating systems
- Process algebra for synchronous communication
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
