P. A. Abdulla, M. Faouzi Atig, G. Delzanno & A. Podelski (2013):
Push-Down Automata with Gap-Order Constraints.
In: FSEN 2013,
pp. 199–216,
doi:10.1007/978-3-642-40213-5_13.
P. A. Abdulla, K. Cerans, B. Jonsson & Y.-K. Tsay (1996):
General Decidability Theorems for Infinite-State Systems.
In: LICS'96,
pp. 313–321,
doi:10.1109/LICS.1996.561359.
P. A. Abdulla, G. Delzanno & L. Van Begin (2011):
A classification of the expressive power of well-structured transition systems.
Inf. Comput. 209(3),
pp. 248–279,
doi:10.1016/j.ic.2010.11.003.
P. A. Abdulla & B. Jonsson (2001):
Ensuring completeness of symbolic verification methods for infinite-state systems.
Theor. Comput. Sci. 256(1-2),
pp. 145–167,
doi:10.1016/S0304-3975(00)00105-5.
P. A. Abdulla & A. Nylén (2000):
Better is Better than Well: On Efficient Verification of Infinite-State Systems.
In: LICS'00.
IEEE Computer Society,
pp. 132–140,
doi:10.1109/LICS.2000.855762.
M. Bartoletti, P. Degano, G. L. Ferrari & R. Zunino (2009):
Local policies for resource usage analysis.
ACM TOPLAS 31(6),
doi:10.1145/1552309.1552313.
M. Bozzano:
A Logic-Based Approach to Model Checking of Parameterized and Infinite-State Systems, PhD Thesis, DISI, University of Genova, June 2002.
X. Cai & M. Ogawa (2013):
Well-Structured Pushdown Systems.
In: CONCUR 2013,
pp. 121–136,
doi:10.1007/978-3-642-40184-8_10.
X. Cai & M. Ogawa (2014):
Well-Structured Pushdown System: Case of Dense Timed Pushdown Automata.
In: FLOPS 2014,
pp. 336–352,
doi:10.1007/978-3-319-07151-0_21.
R. Chadha & M. Viswanathan (2009):
Deciding branching time properties for asynchronous programs.
Theor. Comput. Sci. 410(42),
pp. 4169–4179,
doi:10.1016/j.tcs.2009.01.021.
G. Delzanno (2007):
Constraint-based automatic verification of abstract models of multithreaded programs.
TPLP 7(1-2),
pp. 67–91,
doi:10.1017/S1471068406002821.
G. Delzanno (2015):
Data Tracking in Parameterized Verification.
In: TGC 2015.
G. Delzanno & F. Rosa-Velardo (2013):
On the coverability and reachability languages of monotonic extensions of Petri Nets.
Theor. Comput. Sci. 467,
pp. 12–29,
doi:10.1016/j.tcs.2012.09.021.
A. Finkel & Ph. Schnoebelen (2001):
Well-structured transition systems everywhere!.
Theor. Comput. Sci. 256(1-2),
pp. 63–92,
doi:10.1016/S0304-3975(00)00102-X.
R. Lazic, T. C. Newcomb, J. Ouaknine, A. W. Roscoe & J. Worrell (2007):
Nets with Tokens Which Carry Data.
In: ICATPN 2007,
pp. 301–320,
doi:10.1007/978-3-540-73094-1_19.
R. Majumdar, R. Meyer & Z. Wang (2013):
Provenance Verification.
In: RP '13,
pp. 21–22,
doi:10.1007/978-3-642-41036-9_3.
F. Rosa-Velardo & D. de Frutos-Escrig (2009):
Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication.
In: Petri Nets,
pp. 63–82,
doi:10.1007/978-3-642-02424-5_6.
N. Tzevelekos (2011):
Fresh-register automata.
In: POPL 2011,
pp. 295–306,
doi:10.1145/1926385.1926420.
N. Tzevelekos & R. Grigore (2013):
History-Register Automata.
In: FOSSACS 2013,
pp. 17–33,
doi:10.1007/978-3-642-37075-5_2.
eptcs@eptcs.org