Trellis processes: AAAA compact representation for runs of concurrent systems

Discrete Event Dynamic Systems: Theory and Applications

Volumn 17, Issue 3, 2007, Pages 267-306

  Fabre, Eric ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

Branching process; Category theory; Concurrent system; Diagnosis; Factorization; Petri net; Product; Trellis; True concurrency semantics; Unfolding

Indexed keywords

COMPUTER SYSTEM RECOVERY; CONCURRENT ENGINEERING; DIAGNOSIS; FACTORIZATION; PARALLEL ALGORITHMS; PETRI NETS;

BRANCHING PROCESS; CATEGORY THEORY; TRUE CONCURRENCY SEMANTICS;

TRELLIS CODES;

EID: 34548297019     PISSN: 09246703     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10626-006-0001-0     Document Type: Article

References (40)

1. Baroni P, Lamperti G, Pogliano P, Zanella, M (1999) Diagnosis of large active systems. Artificial Intelligence 110:135-183
2. Benveniste A, Fabre E, Haar S, Jard C (2003) Diagnosis of asynchronous discrete event systems, a net unfolding approach. IEEE Transactions on Automatic Control 48(5):714-727
3. Boel RK, Jiroveanu G (2004) Distributed contextual diagnosis for very large systems. In: Proc. of WODES'04, pp 343-348
4. Boel RK, van Schuppen JH (2002) Decentralized failure diagnosis for discrete event systems with costly communication between diagnosers. In: Proc. 6th Int. Workshop on Discrete Event Systems, WODES'02, pp 175-181
5. Contant O, Lafortune S (2004) Diagnosis of modular discrete event systems. In: Proc. of WODES'04, pp 337-342
6. Couvreur J-M, Grivet S, Poitrenaud D (2001) Unfolding of products of symmetrical petri nets. 22nd International Conference on Applications and Theory of Petri Nets (ICATPN 2001), pp 121-143. LNCS 2075
7. Debouk R, Lafortune S, Teneketzis D (2000) Coordinated decentralized protocols for failure diagnosis of discrete event systems. Journal of Discrete Event Dynamical Systems: Theory and Application 10(1/2):33-86
8. Engelfriet J (1991) Branching processes of petri nets. Acta Informatica, 28:575-591
9. Esparza J (1994) Model checking using net unfoldings. Science of Computer Programming 23:151-195
10. Esparza J, Römer S, Vogler W (1996) An improvement of McMillan's unfolding algorithm. In: Proc. of TACAS'96, LNCS 1055, pp 87-106
11. Esparza J, Römer S, Vogler W (2002) An improvement of McMillan's unfolding algorithm. Formal Methods in System Design 20(3):285-310 (Extended version of Esparza et al (1996))
12. Esparza J, Römer S (1999) An unfolding algorithm for synchronous products of transition systems. In: Proc. of CONCUR'99, LNCS 1664, Springer, Berlin Heidelberg New York
13. Esparza J, Schröter C (2000) Reachability analysis using net unfoldings. Workshop of Concurrency, Specification and Programming, Volume II of Informatik-Bericht 140, pp 255-270 (Humboldt-Universität zu Berlin)
14. Fabre E (2003a) Factorization of unfoldings for distributed tile systems, part 1: limited interaction case. Inria Research Report no. 4829
15. Fabre E (2003b) Convergence of the turbo algorithm for systems defined by local constraints. Irisa Research Report no. PI 1510
16. Fabre E (2004) Factorization of unfoldings for distributed tile systems, part 2: general case. Inria Research Report no. 5186
17. Fabre E (2005) Distributed diagnosis based on trellis processes. In: 44th Conf. on Decision and Control (CDC), Seville, Spain, pp 6329-6334
18. Fabre E, Hadjicostis C (2006) A trellis notion for distributed system diagnosis with sequential semantics. In: Proc. 8th Int. Workshop on Discrete Events Systems, WODES'06, pp 294-300
19. Fabre E, Benveniste A, Haar S, Jard C (2005) Distributed monitoring of concurrent and asynchronous systems. Journal of Discrete Event Systems, special issue 15(1):33-84
20. Genc S, Lafortune S (2003) Distributed diagnosis of discrete-event systems using petri nets. In: Proc. 24th Int. Conf. on Applications and Theory of Petri Nets, LNCS 2679, pp 316-336
21. Giua A, Xie X (2004) Control of safe ordinary Petri nets with marking specifications using unfolding. In: Proc. of WODES'04: 7th Workshop on Discrete Event Systems, Reims, France
22. Giua A, Xie X (2005) Control of safe ordinary Petri nets using unfoldings. Journal of Discrete Event Dynamical Systems, 15(4):349-375
23. Khomenko V, Koutny M, Vogler W (2003) Canonical prefixes of petri net unfoldings. Acta Informatica 40:95-118
24. Khomenko V, Kondratyev A, Koutny M, Vogler W (2005) Merged processes-a new condensed representation of Petri net behavior. Tech. Rep. Series CS-TR-884, Univ. of Newcastle upon Tyne
25. Mac Lane S (1971) Categories for the working mathematician. Springer, Berlin Heidelberg New York
26. McMillan KL (1992) Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In: Proc. 4th Workshop of Computer Aided Verification, Montreal, pp 164-174
27. McMillan KL (1993) Symbolic model checking: an approach to the state explosion problem, Ph.D. Thesis. Kluwer, Boston, MA
28. Melzer S, Römer S (1997) Deadlock checking using net unfoldings. CAV'97, LNCS 1254, pp 352-363
29. Nielsen M, Plotkin G, Winskel G (1981) Petri nets, event structures and domains. Theoretical Computer Science 13(1):85-108
30. Reisig W (1985) Petri Nets. Springer, Berlin Heidelberg New York
31. Sampath M, Sengupta, R, Lafortune S, Sinnamohideen K, Teneketzis D (1995) Diagnosability of discrete-event systems. IEEE Transaactions on Automatic Control 40(9):1555-1575
32. Sampath M, Sengupta R, Sinnamohideen K, Lafortune S, Teneketzis D (1996) Failure diagnosis using discrete event models. IEEE Transactions on Systems Technology 4(2):105-124
33. Su R (2004) Distributed diagnosis for discrete-event systems, Ph.D. Thesis. Dept. of Elec. and Comp. Eng., Univ. of Toronto
34. Su R, Wonham WM, Kurien J, Koutsoukos X (2002) Distributed diagnosis for qualitative systems. In: Proc. 6th Int. Workshop on Discrete Event Systems, WODES'02 pp 169-174
35. Vaandrager FW (1989) A simple definition for parallel composition of prime events structures. Report CS-R8903, CWI, Amsterdam
36. Winskel G (1983) Event structure semantics of CCS and related languages. LNCS 140, 1982, also as report PB-159, Aarhus Univ., Denmark
37. Winskel G (1984) A new definition of morphism on petri nets, LNCS 166 pp 140-149
38. Winskel G (1985) Categories of models for concurrency. Seminar on Concurrency, Carnegie-Mellon Univ., pp 246-267, LNCS 197
39. Winskel G (1997) Petri nets, algebras, morphisms, and compositionality. Information and Computation, 72:197-238
40. Yoo T, afortune S (2002) A general architecture for decentralized supervisory control of discrete-event systems. Journal of Discrete Event Dynamical Systems: Theory and Application, 12(3):335-377