Building tight occurrence nets from reveals relations

Proceedings - International Conference on Application of Concurrency to System Design, ACSD

Volumn , Issue , 2011, Pages 44-53

  Balaguer, Sandie ^a   Chatain, Thomas ^a   Haar, Stefan ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

event logics; maximal runs; occurrence nets; Petri nets; synthesis of concurrent systems

Indexed keywords

BOOLEAN FORMULAE; CONCURRENT BEHAVIOR; EVENT LOGIC; LOGICAL DEPENDENCIES; MAXIMAL RUNS; OCCURRENCE NET; OCCURRENCE NETS; PARTIAL ORDER; SYNTHESIS PROBLEMS;

PETRI NETS; SYSTEMS ANALYSIS;

BOOLEAN ALGEBRA;

EID: 80052641791     PISSN: 15504808     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSD.2011.16     Document Type: Conference Paper

References (18)

1. S. Haar, "Types of asynchronous diagnosability and the reveals-relation in occurrence nets," IEEE Transactions on Automatic Control, vol. 55, no. 10, pp. 2310-2320, 2010.
2. M. Nielsen, G. D. Plotkin, and G. Winskel, "Petri nets, event structures and domains, part I," Theor. Comput. Sci., vol. 13, pp. 85-108, 1981.
3. J. Engelfriet, "Branching processes of Petri nets," Acta Inf., vol. 28, no. 6, pp. 575-591, 1991.
4. K. L. McMillan, "Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits," in CAV, ser. LNCS, vol. 663. Springer, 1992, pp. 164-177.
5. J. Esparza, S. Römer, and W. Vogler, "An improvement of McMillan's unfolding algorithm," Formal Methods in System Design, vol. 20, no. 3, pp. 285-310, 2002.
6. V. Khomenko, "Model checking based on prefixes of Petri net unfoldings," Ph.D. dissertation, School of Computing Science, University of Newcastle upon Tyne, 2003.
7. W. Vogler, "Fairness and partial order semantics," Inf. Process. Lett., vol. 55, no. 1, pp. 33-39, 1995.
8. V. Khomenko, M. Koutny, and A. Yakovlev, "Detecting state encoding conflicts in STG unfoldings using SAT," Fundam. Inf., vol. 62, no. 2, pp. 221-241, 2004.
9. L. Bernardinello, "Synthesis of net systems," in ICATPN, ser. LNCS, vol. 691. Springer, 1993, pp. 89-105.
10. J. Desel and W. Reisig, "The synthesis problem of Petri nets,"Acta Informatica, vol. 33, pp. 297-315, 1996.
11. E. Badouel, B. Caillaud, and P. Darondeau, "Distributing finite automata through Petri net synthesis," Journal on Formal Aspects of Computing, vol. 13, pp. 447-470, 2002. (Pubitemid 41204147)
12. J. Carmona, J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, and A. Yakovlev, "A symbolic algorithm for the synthesis of bounded Petri nets," in ICATPN, ser. LNCS. Springer-Verlag, 2008, vol. 5062, pp. 92-111.
13. P. Darondeau, "Deriving unbounded petri nets from formal languages," in CONCUR, ser. LNCS, vol. 1466. Springer, 1998, pp. 533-548.
14. R. Bergenthum, J. Desel, R. Lorenz, and S. Mauser, "Synthesis of Petri nets from finite partial languages," Fundam. Inform., vol. 88, no. 4, pp. 437-468, 2008.
15. A. Ehrenfeucht and G. Rozenberg, "Partial (set) 2-structures. parts I and II," Acta Inf., vol. 27, no. 4, pp. 315-368, 1989.
16. E. Badouel and P. Darondeau, "Theory of regions," in Lectures on Petri Nets I: Basic Models, ser. LNCS. Springer Berlin / Heidelberg, 1998, vol. 1491, pp. 529-586.
17. P. Gastin and D. Kuske, "Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces," Information and Computation, vol. 208, no. 7, pp. 797-816, 2010.
18. W. Penczek, "Branching time and partial order in temporal logics," in Time and Logic: A Computational Approach. UCL Press, 1995, pp. 179-228.