Translating FSP into LOTOS and networks of automata

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Most cited references 24

Record: found
Abstract: not found
Book Chapter: not found

Concurrency and automata on infinite sequences

David Park (1981)

0 comments Cited 120 times – based on 0 reviews

Bookmark

Record: found
Abstract: not found
Article: not found

A Theory of Communicating Sequential Processes

S. D. Brookes, C. Hoare, A. W. Roscoe (1984)

0 comments Cited 116 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

CCS expressions, finite state processes, and three problems of equivalence

Paris Kanellakis, Scott A Smolka (1990)

0 comments Cited 55 times – based on 0 reviews      Review now

Bookmark

All references

Author and article information

Journal

Title: Formal Aspects of Computing

Abbreviated Title: Form Asp Comp

Publisher: Springer Nature

ISSN (Print): 0934-5043

ISSN (Electronic): 1433-299X

Publication date Created: November 2010

Publication date (Print): November 18 2009

Volume: 22

Issue: 6

Pages: 681-711

Article

DOI: 10.1007/s00165-009-0133-8

SO-VID: a9e64de1-1738-43bc-8435-2e78eda0f7bf

History

Data availability:

Comments

Comment on this article

scite_

Smart Citations

Citing PublicationsSupportingMentioningContrasting

View Citations

See how this article has been cited at scite.ai

scite shows how a scientific paper has been cited by providing the context of the citation, a classification describing whether it supports, mentions, or contrasts the cited claim, and a label indicating in which section the citation was made.