Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
type: Item
instance of: scholarly article
title: Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
zbMATH Open document ID: 1072.68074
author: Irek Ulidowski
author: Shoji Yuen
published in: The Journal of Logic and Algebraic Programming
publication date: 2004-09-08T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 2099292
MaRDI profile type: Publication
full work available at URL: j.jlap.2004.03.002
OpenAlex ID: W2046810743
cites work: Observation equivalence as a testing equivalence
cites work: Turning SOS rules into equations
cites work: Axiomatizing prefix iteration with silent steps
cites work: Q4375631
cites work: Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination
cites work: Real time process algebra
cites work: Discrete time process algebra
cites work: Q4727412
cites work: Process algebra with timing: Real time and discrete time
cites work: Process algebra with timing
cites work: Process Algebra
cites work: Structural operational semantics for weak bisimulations
cites work: Bisimulation can't be traced
cites work: The meaning of negative premises in transition system specifications
cites work: Rooted branching bisimulation as a congruence
cites work: The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
cites work: Branching time and abstraction in bisimulation semantics
cites work: Transition system specifications with negative premises
cites work: Structured operational semantics and bisimulation as a congruence
cites work: A process algebra for timed systems
cites work: Q3777424
cites work: A formal definition of time in LOTOS
cites work: Q3929062
cites work: Q3992568
cites work: Testing equivalences for processes
cites work: The algebra of timed processes, ATP: Theory and application
cites work: Refusal testing
cites work: A timed model for communicating sequential processes
cites work: An operational semantics for timed CSP
cites work: Higher-level synchronising devices in Meije-SCCS
cites work: Finite axiom systems for testing preorder and De Simone process languages
cites work: CONCUR 2003 - Concurrency Theory
cites work: Ordered SOS process languages for branching and eager bisimulations
cites work: Q4536608
cites work: Q4847024
cites work: Bisimulation and divergence
cites work: Q4733394
DOI: 10.1016/J.JLAP.2004.03.002
description: scientific article; zbMATH DE number 2099292