Failures semantics based on interval semiwords is a congruence for refinement
- 1 September 1991
- journal article
- Published by Springer Nature in Distributed Computing
- Vol. 4 (3) , 139-162
- https://doi.org/10.1007/bf01798961
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- On representing CCS programs by finite petri netsPublished by Springer Nature ,2005
- Some equivalence notions for concurrent systems. An overviewPublished by Springer Nature ,2005
- Maximality preserving bisimulationTheoretical Computer Science, 1992
- Fully abstract models for a process language with refinementPublished by Springer Nature ,1989
- Sequential and concurrent behaviour in Petri net theoryTheoretical Computer Science, 1987
- Modeling concurrency with partial ordersInternational Journal of Parallel Programming, 1986
- A Theory of Communicating Sequential ProcessesJournal of the ACM, 1984
- The non-sequential behaviour of Petri netsInformation and Control, 1983
- Petri nets, event structures and domains, part ITheoretical Computer Science, 1981
- Intransitive indifference with unequal indifference intervalsJournal of Mathematical Psychology, 1970