Process languages with discrete relative time based on the Ordered SOS format and rooted eager bisimulation-Reference-Cited by-同舟云学术

Process languages with discrete relative time based on the Ordered SOS format and rooted eager bisimulation

Published:2004-07 Issue: Volume:60-61 Page:401-460
ISSN:1567-8326
Container-title:The Journal of Logic and Algebraic Programming
language:en
Short-container-title:The Journal of Logic and Algebraic Programming

Author:

Ulidowski Irek,Yuen Shoji

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Logic,Theoretical Computer Science,Software

Reference60 articles.

1. Observation equivalence as a testing equivalence;Abramsky;Theoretical Computer Science,1987

2. Turning SOS rules into equations;Aceto;Information and Computation,1994

3. Axiomatizing prefix iteration with silent steps;Aceto;Information and Computation,1996

4. An equational axiomatisation of observation congruence for prefix iteration;Aceto,1996

5. J.C.M. Baeten, Embedding untimed into timed process algebra: the case for explicit termination, in: L. Aceto, B. Victor (Eds.), Proceedings of the 7th International Workshop on Expressiveness in Concurrency EXPRESS'00, BRICS, 2000

Cited by 369 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient analysis of belief properties in process algebra;Journal of Logical and Algebraic Methods in Programming;2024-10

2. A Computational Model of the Secondary Hemostasis Pathway in Reaction Systems;Mathematics;2024-08-04

3. An algebraic approach to simulation and verification for cyber-physical systems with shared-variable concurrency;Journal of Logical and Algebraic Methods in Programming;2024-06

4. A framework for monitored dynamic slicing of reaction systems;Natural Computing;2024-05-04

5. Encodability Criteria for Quantum Based Systems;Logical Methods in Computer Science;2024-04-30