1989-05-30
Process theory based on bisimulation semantics
Publication
Publication
Presented at the
Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency (May 1988), Noordwijkerhout, The Netherlands
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics are covered: (i) specification of processes using finite systems of equations over the syntax of process algebra; (ii) inference systems which are complete for proving the equivalence of regular (finite state) processes; (iii) variations of the bisimulation model.
| Additional Metadata | |
|---|---|
| , , | |
| Springer | |
| doi.org/10.1007/BFb0013021 | |
| Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency | |
| Organisation | Specification and Analysis of Embedded Systems |
|
Bergstra, J., & Klop, J. W. (1989). Process theory based on bisimulation semantics. In Lecture Notes in Computer Science (pp. 50–122). Springer. doi:10.1007/BFb0013021 |
|
