Faculty Profiles - YUEN, Shoji

Papers - YUEN, Shoji

Division display >> ／ All the affair displays 1 - 85 of about 85

RevMiGo: Reversible Channel-Based Communication in Go Language Invited Reviewed International coauthorship International journal

Shunya Oguchi, Shoji Yuen, Nobuko Yoshida

Lecture Notes in Computer Science Vol. 15716 page： 119 - 127 2025.7

Authorship：Corresponding author Language：English Publishing type：Research paper (scientific journal) Publisher：Springer

DOI： 10.1007/978-3-031-97063-4\_9

Research data storage URL： https://thersacjp.sharepoint.com/:f:/r/sites/ResearchDataArchive/Shared%20Documents/workspace/202603-THF11065251-00-003917?csf=1&web=1&e=ER7r4d

並行可逆プログラミング言語Concurrent Janusおよびその処理系 Reviewed

黒田将弘,結縁祥治

第27回プログラミングおよびプログラミング言語ワークショップ発表予稿集 page： C1-2:1 - C1-2:19 2025.3

Constant Propagation in CRIL by Bidirectional Data Flow Analysis Reviewed

Snunya Oguchi, Shoji Yuen

Journal of Information Processing Vol. 32 page： 552 - 564 2024.7

Concurrent RSSA for CRIL: Flow Analysis for a Concurrent Reversible Programming Language Reviewed

Shunya Oguchi, Shoji Yuen

Lecture Notes in Computer Science Vol. 14680 page： 181 - 200 2024.5

revTPL: The Reversible Temporal Process Language Reviewed International coauthorship

Laura Bocchi ; Ivan Lanese ; Claudio Antares Mezzina ; Shoji Yuen.

Logical Method in Computer Science Vol. 20 ( 1 ) page： 11:1 - 11:35 2024.1

CRIL: A Concurrent Reversible Intermediate Language Reviewed

Shunya Oguchi, Shoji Yuen

Electronic Proceedings in Theoretical Computer Science Vol. 387 page： 149 - 167 2023.9

CROOPLPP : A Reversible Concurrent Object-oriented Programming Language

Yusuke Akaike, Shoji Yuen

Vol. 123 page： 13 - 18 2023.7

CRSSA: 並行可逆言語に対する静的単一代入 Reviewed

小口隼也, 結縁祥治

第25回プログラミングおよびプログラミング言語ワークショップ PPL 2023 page： 1 - 20 2023.3

A reversible debugger for imparative parallel programs with contracts Reviewed

Takashi Ikeda, Shoji Yuen

Reversible Computation 2022, Lecture Notes in Computer Science Vol. 13354 page： 204 - 212 2022.7

The reversible temporal process language Reviewed International coauthorship Open Access

Laura Bocchi, Ivan Lanese, Claudio Antrares Mezzina, Shoji Yuen

Proceedings of FORTE 2022, Lecture Notes in Computer Science Vol. 13273 page： 31 - 49 2022.6

A reversible runtime for parallel programs with recursive blocks Reviewed Open Access

2021.11

Multiparty Session Programming with Global Protocol Combinators(Artifact) Invited Reviewed International coauthorship Open Access

Keigo Imai, Rumiyana Neykova, Nobuko Yoshida, Shoji Yuen

Dagstuhl Artifacts Series Vol. 6 ( 2 ) page： 1 - 2 2020.11

Multiparty Session Programming with Global Combinators Invited Reviewed International coauthorship Open Access

Keigo Imai, Rumiyana Neykova, Nobuko Yoshida, Shoji Yuen

LIPlcs Vol. 166 page： 9:1 - 9:30 2020.11

A Reversible Runtime Environment for Parallel Programs Reviewed Open Access

Takashi Ikeda, Shoji Yuen

Reversible Computation 2020, Lecture Notes in Computer Science Vol. 12247 page： 272-279 2020.7

Fault Diagnosis for Distributed Cooperative System Using Inducting Logic Programming Invited Reviewed

Shuichi Sato, Yosuke Watanabe, Hiroyuki Seki, Yoshinao Ishii, Shoji Yuen

IEEE International Conference on Prognostics and Health Management, ICPHM 2020 page： 1 - 8 2020.6

Automating Time-series Safety Analysis for Automotive Control Systems Using Weighted Partial Max-SMT Reviewed

Shuichi Sato, Shogo Hattori, Hiroyuki Seki, Yutaka Inamori, Shoji Yuen

Journal of Information Processing Vol. 28 page： 124-135 2020.1

Session-ocaml: A session-based library with polarities and lenses Reviewed Open Access

Keigo Imai, Nobuko Yoshida, Shoji Yuen

Science of Computer Program Vol. 172 page： 135-159 2019.3

Reversing Event Structure Reviewed Open Access

Irek Ulidowski, Iain Phillips, Shoji Yuen

New Generation Computing Vol. 36 page： 281-306 2018.9

Reversing Parallel Programs with Blocks and Procedures Reviewed Open Access

James Hoey, Irek Ulidowski, Shoji Yuen

EPTCS (EXPRESS/SOS 2018) Vol. 276 page： 69-86 2018.9

Nested Timed Automata with Invariants Reviewed

Yuwei Wang, Guoqiang Li, Shoji Yuen

Lecture Notes in Computer Science Vol. 10606 page： 77-93 2017.10

Nested Timed Automata with Diagonal Constraints Reviewed

Yuwei Wang, Yunqing Wen, Guoqiang Li, Shoji Yuen

Lecture notes in computer science Vol. 10610 page： 396-412 2017.11

Reversing Imperative Parallel Programs. Reviewed Open Access

James Hoey, Irek Ulidowski, Shoji Yuen

Proceedings Combined 24th International Workshop on Expressiveness in Concurrency and 14th Workshop on Structural Operational Semantics and 14th Workshop on Structural Operational Semantics, EXPRESS/SOS 2017, Berlin, Germany, 4th September 2017. EPTCS 255, 2017 2017.9

Session-ocaml: A Session-Based Library with Polarities and Lenses Reviewed Open Access

Keigo Imai, Nobuko Yoshida, Shoji Yuen

Lecture Notes in Computer Science Vol. 10319 page： 99-118 2017.6

Automating Time Series Safety Analysis for Automotive Control Systems in STPA Using Weighted Partial Max-SMT Reviewed

Shuichi Sato, Shogo Hattori, Hiroyuki Seki,Yutaka Inamori,Shoji Yuen

Communications in Computer and Information Science ( 694 ) page： 39-54 2016.11

An Over-Approximation Forward Analysis for Nested Timed Automata Reviewed

Yunqing Wen, Guoqiang Li, Shoji Yuen

Lecture Notes in Computer Science Vol. 8979 page： 1-15 2015.1

Nested Timed Automata with Frozen Clocks Reviewed

Guoqiang Li, Mizuhito Ogawa, Shoji Yuen

Lecture Notes in Computer Science Vol. 9268 page： 189-205 2015.9

Language：English Publishing type：Research paper (scientific journal)

A nested timed automaton (NeTA) is a pushdown system whose control locations and stack alphabet are
timed automata (TAs). A control location describes a working TA, and the stack presents a pile of
interrupted TAs. In NeTAs, all local clocks of TAs proceed uniformly also in the stack. This paper extends
NeTAs with frozen local clocks (NeTA-Fs). All clocks of a TA in the stack can be either frozen or
proceeding when it is pushed. A NeTA-F also allows global clocks adding to local clocks in the working
TA, which can be referred and/or updated from the working TA. We investigate the reachability of NeTAFs
showing that (1) the reachability with a single global clock is decidable, and (2) the reachability with
multiple global clocks is undecidable.

DOI： 10.1007/978-3-319-22975-1_13

Concurrency and reversibility Invited Reviewed

Irek Ulidowski, Iain Phillips and Shoji Yuen

Reversible Computation 2014, LNCS 8507 ( 8507 ) page： 1-14 2014.7

値付きタスクオートマトンに基づくコストを意識した実時間タスクスケジューリング

結縁祥冶、亀井達朗

信学技報 Vol. 114 ( 127 ) page： 37-42 2014.7

離散事象システムにおけるMaxSATソルバを用いた最大可制御部分仕様の導出

廣田樹、結縁祥冶、東道徹也

信学技報 Vol. 114 ( 271 ) page： 35-40 2014.10

部分観測におけるMaxSATソルバを用いたスーパバイザ合成手法

廣田樹、結縁祥冶、東道徹也

信学技報 Vol. 114 ( 416 ) page： 79-84 2015.1

Modelling of Bonding with Process and Events Reviewed

Iain Phillips, Irek Ulidowski, Shoji Yuen

Lecture Notes in Computer Science Vol. 7948 page： 141-154 2013.7

Modelling and analysis of real-time systems with mutex components Reviewed

Guoqiang Li, Xiaojuan Cai, Shoji Yuen

International Journal of Foundations of Computer Science Vol. 25 ( 4 ) page： 831-851 2012.6

A Reversible Process Calculus and the Modelling of the ERK signalling pathway Reviewed

Iain Phillips, Irek Ulidowski and Shoji Yuen

In Proceedings of the 4th workshop on reversible computation RC2012 page： 227-239 2012.7

A session type systems with subject reduction Reviewed

Keigo Imai, Shoji Yuen, and Kiyoshi Agusa

IEICE Transaction, Infromatoin adn systems Vol. E95-D ( 8 ) page： 2053--2064 2012.8

タスクマイグレーション機能を持つマルチコアスケジューリング解析

中堂園貴幸,結縁祥治

信学技法 Vol. 112 ( 458 ) page： 103-108 2013.3

名前渡しプロセス計算における優先度ガード Reviewed

結縁祥治, 太田正悟

プログラミングおよびプログラミング言語ワークショップ page： 246-257 2011.3

Modeling and Analysis of Real -Time Systems with Mutex Components Reviewed

Guoqiang Li, Xiaojuan Cai, Shoji Yuen

Advances in Parallel and Distributed Computing Models ( 3 ) page： 1-8 2010.4

Session Type Inference in Haskell Reviewed

Keigo Imai, Shoji Yuen, Kiyoshi Agusa

PLACES '10: Programming Language Approaches to Concurrency and Communication-cEntric Software page： 43-52 2010.3

Communication Centered Dependable GUI Programmingbased on Choreography

Sho SHIMOMURA and Shoji YUEN

IEICE Technical Report (Software Science) Vol. 109 ( 456 ) page： 127-132 2010.3

A Type-Based Analysis for Checking Race and Deadlockbased on Access Capabilities

Yoshitaka BANNO and Shoji YUEN

IEICE Technical Report (Software Science) Vol. 109 ( 456 ) page： 133-138 2010.3

Environmental Simulation of Real -Time Systems with Nested Interrupts Reviewed

Guoqiang Li, Shoji Yuen, Masakazu Adachi

Theoretical Aspect of Software Engineering, TASE2009 page： 21-28 2009.7

Language：English

Interrupts are important aspects of real-time embedded
systems to handle events in time. When there exist nested
interrupts in a real-time system, and an urgent interrupt is
allowed to preempt the current interrupt handling, the design
and analysis of the system become difficult due to the lack
of appropriate behavioral models. This paper proposes a
compositional model for nested interrupts and an analysis
named environmental simulation. We present a new kind of
timed transition system, named controller automata, to treat
interrupts. Together with an interrupt environment modeled
as a timed automaton, and a scheduler as a timed automaton
with semaphores, the system behaviors with nested interrupts
are realized by a sequence of transitions with time. Although
various verification problems for this model are undecidable
in general, it is shown that the reachability of error states
is practically solvable with our implementation of the environmental
simulation by Maude.

An SOS interpreter with negative premises andan equivalence checker by Maude

Jun BAN, Keigo IMAI, Shoji YUEN

Vol. 109 ( 40 ) page： 49-54 2009.5

Apache Cocoon Flowscriptのモデル検査によるWeb応用プログラムの動作検証

馬場　敬・結縁祥治・阿草清滋

信学技報SS-0903 page： 19-24 2009.3

Energy Efficient Functional Programing on DVS Systemsby Varying Evaluation Strategies Reviewed Open Access

Tetsuo Yokoyama, Keigo Imai,y1 Gang Zeng,y1Hiroyuki Tomiyama,y1 Hiroaki Takaday1and Shoji Yueny1

Vol. PRO41 ( 2 ) page： 54-69 2009.3

Environmental simulation of real-time systems with nested interrupts in Maude Reviewed

Li Guoqiang, Shoji Yuen, and Masakazu Adachi

page： 133-147 2009.3

A full implementation of session types in Haskell Reviewed

Keigo Imai, Shoji Yuen, and Kiyoshi Agusa

page： 44-56 2009.3

*Generating priority rewrite systems for OSOS process languages Reviewed

Irek Ulidowski and Shoji Yuen

Information and Computation Vol. 207 ( 2 ) page： 120-145 2009.2

Schedulability analysis of real-time systems using propositional satisfiablity Reviewed

Masakazu Adachi, Ryo Suetsugu, Shoji Yuen, Shigeharu Teshima, Noriyoshi Sano

Embedded Systems Symposium 2008 page： 41-49 2008.10

Dependable software design based on communication centered programming

Shoji Yuen

DSW2008 page： 135 2008.7

Communicating Processes with Timed Behavioral Extension Invited Reviewed Open Access

Shoji Yuen

Systems, Control and Information Vol. 52 ( 9 ) page： 322-327 2008.9

Communication centered programming of integrated services with priority in home appliance network Reviewed

Sakura Bhandari, Shoji Yuen, Kiyoshi Agusa

In Proceedings of APSEC2007 Workshop on Service Oriented Architecture page： 8-15 2007.12

Language：English

We propose an extended framework of communication
centered programming for home appliance network where
the distributed environment is designed in the service oriented
architecture. Home appliances are now getting connected
to network. By exchanging messages over network,
various appliances constitute "integrated services"
in that the operations by the appliances are performed
as programmed. Following the communication centered
programming, a global description is directly given
for interactions that involve many appliances. A behaviorally
equivalent local description distributed for the appliances
is derived by the end-point projection(EPP). This
significantly eases the distributed system programming. The
communication centered programming is originally proposed
by Carbone et.al. Services are available at the same
time and a certain service may or must have the precedence
over the other services to be consistent. To cope with this,
we introduce "priority" in the communication centered programming.
We present a design extension for priority both
in global descriptions and local descriptions by examples.
We argue the end-point projection with priority towards the
automatic derivation of local descriptions from global descriptions.

A synchronization flow analysis of concurrent objects in AIBO OPEN-R programs based on communicating processes Reviewed

Ryo Suetsugu, Shoji Yuen, Kiyoshi Agusa

In Proceedings of 14th Asia-pacific software engineering conference APSEC2007, IEEE computer society page： 366-373 2007.12

Language：English

We propose a compositional analysis method for synchronization
flow in AIBO OPEN-R programs based on
communicating processes. Concurrent objects of AIBO programs
with the OPEN-R API are synchronized by two types
of signals: ready and notify. Focusing on these signals,
we describe abstract behavior of AIBO programs in the pi-
calculus preserving the source code structure. We modelcheck
deadlock freeness and interactions order of AIBO
programs based on this abstract behavior. Since a primary
issue in model-checking is the state space explosion in the
behavioral model, we present a decomposing method to reduce
the combination of states of concurrent objects. Since
our translation to the pi-calculus preserves the syntactical
structure of source code, when a counter-example is pointed
out, our method enables not only to detect the violation of
property of the whole system, but also to point out which
component may cause the violation. We developed a prototype
translator from AIBO OPEN-R programs to abstract
description in the pi-calculus. We show that an application
of our decomposing method enables to practically modelcheck
properties by existing tools in two examples of AIBO
programs.

DOI： 10.1109/ASPEC.2007.70

A Deadlock free analysis for AIBO OPEN-R programs based on communicating processes Reviewed Open Access

Ryo Suetsugu, Shoji Yuen, Kiyoshi Agusa

IPSJ Journal Vol. 48 ( 9 ) page： 2915-2924 2007.9

分散環境における家電機器の連携動作の記述手法

バンダリさくら、結縁祥治、阿草清滋

第５回ディペンダブルシステムワークショップ論文集 page： 35-44 2007.7

セッション型に基づく高信頼性ネットワークプログラムのHaskell言語による実装

今井敬吾、結縁祥治、阿草清滋

第５回ディペンダブルシステムワークショップ論文集 page： 95-106 2007.7

π計算におけるセッションの構造化

今井敬吾、結縁祥治、阿草清滋

第９回プログラミングおよびプログラミング言語ワークショップ論文集 page： 140-154 2007.3

A Network Programming Framework in Haskell Based on Asynchronous Localized pi-calculus Reviewed

Keigo Imai, Shoji Yuen, Kiyoshi Agusa

IPSJ Transaction:Programming ( 47 ) page： 10,18 2006.10

π計算に対する時間拡張と合同的性質 Reviewed Open Access

桑原寛明, 結縁祥治, 阿草清滋

電子情報通信学会論文誌 Vol. J89-D ( 4 ) page： 632,641 2006.4

通信プロセスモデルと形式意味論に基づくソフトウェアのモデル化 Reviewed Open Access

コンピュータソフトウェア Vol. 22 page： 22-43 2005

*Web Automata: A Behavioral Model of Web Applications based on the MVC Reviewed Open Access

Shoji Yuen, Keishi Kato, Daiju Kato, Kiyoshi Agusa

Computer Software Vol. 22 page： 44-57 2005

Authorship：Lead author Language：English Publishing type：Research paper (scientific journal)

We propose a behavioral model of web applications
based on the MVC(Model View and Control)
model architecture. The MVC model architecture
separates design concerns to improve the overall
software quality. Since the architecture defines the
abstract outline of the configurations, there is a
broad gap between coding web applications and its
behavioral property.
We propose a behavioral model, called 'Web Automata',
to implement the MVC architecture. We
model the behavior of a web application with dynamic
contents as an extension of links-automata
proposed by Stotts et.al. As extended in the model
checking techniques, we view a web application as a
data-independent system, where variables appearing
in link parameters and form inputs are attached
to each page.
We propose a testing framework for web applications
based on the behavioral model. We show it
provides testing criteria for web applications when
we focus on the loops on the behavior automata.
We apply our framework to the Jakarta Struts by
presenting the extended configuration schema of
Struts in order to describe the web automata directly.

DOI： 10.11309/jssst.22.2_44

Open Access

Name-passing style GUI Programming in a pi-calculus-based language Nepi Reviewed

Atsushi Mizuno, Ken Mano, Yoshinobu Kawabe, Hiroaki Kuwabara, Shoji Yuen, Kiyoshi Agusa

Electric Notes of Theoretical Computer Science Vol. 139 page： 145-168 2005

Authorship：Lead author Language：English Publishing type：Research paper (scientific journal)

This paper describes name-passing style Graphic User Interface (GUI) programming in the programming language Nepi whose operational semantics is based on the rendezvous-style name-passing communication of the π-calculus. Nepi is able to have timed behavior by combining the wait prefix with the external choice. We model GUI programs by using channel-based behavioral characterization. We propose a pair of extended syntax elements `?g' and `!g' in Nepi to generate and terminate graphic components. The graphic components are accompanied by event handling processes that convert an event to specified name-passing. In the extended Nepi, a GUI program is described as the composition of graphic components, event handling processes, and function processes that implement the real function. We present an implementation of a GUI extension for Nepi programming language on Allegro Common Lisp to illustrate the features of name-passing style GUI programming in Nepi with examples. Finally, we discuss a formal treatment and verification technique based on the extended reduction semantics of Nepi.

Towards Assurign Quality Attributes of Client Dynamic Web Applications: Identifying and Addressing the Challenges Reviewed

Mohammed Sharaf Aun, Shoji Yuen, Kiyoshi Agusa

Journal of Web Engineering Vol. 4 page： 144-164 2005

通信プロセスモデルに基づく並行オブジェクト指向言語によるAIBOプログラムの動作記述 Reviewed

末次亮、結縁祥治、阿草清滋

ソフトウェア工学の基礎ワークショップFOSE2005 page： 267-276 2005.11

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

Irek Ulidowski, Shoji Yuen

The Journal of Logic and Algebraic Programming Vol. 60-61 page： 401-460 2004.12

Language：English Publishing type：Research paper (scientific journal)

We propose a uniform framework, based on the Ordered Structural Operational Semantics (OSOS)
approach of Ulidowski and Phillips [Information and Computation 178 (1) (2002) 180], for process
languages with discrete relative time. Our framework allows the user to select favourite process
operators, whether they are standard operators or new application-specific operators, provided that
they are OSOS definable and their OSOS rules satisfy several simple conditions. The obtained timed
process languages preserve a timed version of rooted eager bisimulation preorder and the time determinacy
property. We also propose several additional conditions on the type of OSOS definitions for
the operators so that several other properties which reflect the nature of time passage, such as the
maximal progress, patience and time persistence properties, are also satisfied.

DOI： 10.1016/j.jlap.2004.03.002

Name-passing style GUI programming in the π-calculus-based language Nepi Reviewed

ARTS2004(6th AMAST Workshop on Real-Time Systems)Technical Report University of Leicester ( 2004/28 ) page： 49-66 2004

An Approach for Debugging Client Dynamic Web Applications Reviewed Open Access

Mohammed Sharaf Aun, Shoji Yuen, Kiyoshi Agusa

Vol. 45 page： 2373-2383 2004

FCDG に基づいたコーディングパターン Reviewed Open Access

コンピュータソフトウェア Vol. 21 ( 4 ) page： 27-36 2004

時間付きπ計算によるリアルタイムオブジェクト指向言語の形式的記述 Reviewed Open Access

桑原寛明、結縁祥治、阿草清滋

情報処理学会論文誌 Vol. 45 ( 6 ) page： 1498-1507 2004

Language：Japanese Publishing type：Research paper (scientific journal)

組み込みシステムなどのプログラミングに用いられるオブジェクト指向言語の時間特性を形式的に記述することによってその振る舞いをできるだけ精密に特徴づけた。π計算に時間経過を導入するによって、オブジェクトの時間的振る舞いを定式化する。このことによって、小規模な実時間システムのプログラムの検証の直接的な基盤モデルを確立した。

Open Access

π計算に対する時間拡張と代数的意味論 Reviewed

桑原寛明、結縁祥治、阿草清滋

ソフトウェア工学の基礎ワークショップFOSE2004 page： 97-108 2004.11

時間オートマトンの遷移制約記述に基づくAIBOプログラムスケルトンコードの生成手法 Reviewed

末次亮、結縁祥治、阿草清滋

組込みソフトウェアシンポジウム2004 page： 126-133 2004.10

Testing Framework for Web Applications based on the MVC model with Behavioral Description Reviewed

Shoji Yuen, Keishi Kato, Daiju Kato, Shinichiro Yamamoto, Kiyoshi Agusa

Proceedings of ICITA page： 11-4:1-6 2004.1

実行可能なメモリモデルに基づくJava並行プログラムのモデル検査 Reviewed

深谷直彦、結縁祥治、阿草清滋

ソフトウェア工学の基礎ワークショップFOSE2003 page： 227-238 2003.11

時間つきπ計算によるリアルタイムオブジェクト指向言語の形式的記述 Reviewed

桑原寛明、結縁祥治、阿草清滋

オブジェクト指向最前線 page： 69-76 2003.8

Process Languages for Rooted Weak Preorders

Irek Ulidowski, Shoji Yuen

Technical Report , University of Leicester Vol. 2002 ( 11 ) 2002

A Semi-Multihoming Technique Using Network Address Translator Reviewed Open Access

Shoji Kajita, Shoji Yuen

Journal of Information Processing Society of Japan Vol. 42 ( 12 ) 2001

Language：Japanese Publishing type：Research paper (scientific journal)

This paper presents a multihoming technique for a middle or small sized network using NAT (Network Address Translator). We call our technique semi-multihoming since we only consider the user-side multihoming, where the typical multihoming enables to bridge the cdonnections while ours does not. THe advantage of our technique is that the flexible load-balancing between the connections is possible based on the local routing policy independent of the global policy to which the network may belong. NAT is the key technology to enable our technique to implement on the existing network equipments. FInally, we show an impementation and the result of our technique at Center for Information Media Studies, Nagoya University.

Open Access

Timed Properties for Process Languages with Time Reviewed

Irek Ulidowski and Shoji Yuen

In Proceedings of SCI2001, Volume XIV page： 344-349 2001

Authorship：Lead author Language：English

We present a uniform framework for defining timed process languages
based on the OSOS(Ordered Structural Operational Semantics)
approach
proposed by Ulidowski and Phillips. Our aim is
to develop a general method for extending arbitrary process
languages with temporal actions. An application of this
method to a process language, for example CCS or CSP,
produces an extension of the language with additional process
operators and the notion of time that are most suitable
a task in hand. We review several important properties of
time passage, for example time determinacy,
and propose several syntactic conditions which
guarantee these properties in a process language
with time.

General Process Languages with Time

Irek Ulidowski, Shoji Yuen

Technical Report, University of Leicester Vol. 2000 ( 41 ) 2000

Process Languages for Rooted Eager Bisimulation Reviewed

Lecture Notes in Computer Science Vol. 1877 page： 275,289 2000.8

*Testing Theory for Probabilistic Processes Reviewed

Rance Cleaveland, Zeynep Dayar, Scott Smolka, Shoji Yuen

Information and Computation Vol. 154 page： 93-148 1999

Symbolic Alternative Characterizations of Testing Preorders for Rugular Real-time Communicating Processes Open Access

Vol. J80-D-1 ( 6 ) page： 474-485 1997

Extending Process Language with Time Reviewed

Lecture Notes In Computer Science Vol. 1349 1997

Fully Abstract Characterizations of Testing Preorders for Probabilistic Processes Reviewed

Lecture Notes in Computer Science Vol. 836 page： 497-512 1994

An extension of the testing method for processes passing infinite values Reviewed

Shoji Yuen, Toshiki Sakabe, Yasuyoshi Inagaki

Workshop in Computing page： 155-173 1993

An Extension of the Testing Method for Processes Passing Infinite Values Reviewed

The John Hopkins University page： 10:1-20 1992.8

CCSによるモニタ記述の形式的記述 Reviewed

結縁祥治、坂部俊樹、稲垣康義

電子情報通信学会論文誌 Vol. J73-D-1 page： 683-692 1990

　 PREV - NEXT 　

<YUEN, Shoji>

Papers - YUEN, Shoji