Sciweavers

4 search results - page 1 / 1
» Deciding First-Order Properties for Sparse Graphs
Sort
View
FOCS
2010
IEEE
13 years 9 months ago
Deciding First-Order Properties for Sparse Graphs
Zdenek Dvorak, Daniel Král, Robin Thomas
FSTTCS
2010
Springer
13 years 9 months ago
First-Order Logic with Reachability Predicates on Infinite Systems
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...
Stefan Schulz
FUIN
2007
135views more  FUIN 2007»
13 years 10 months ago
On First-Order Fragments for Mazurkiewicz Traces
Mazurkiewicz traces form a model for concurrency. Temporal logic st-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical prop...
Volker Diekert, Martin Horsch, Manfred Kufleitner
SIGMETRICS
2008
ACM
119views Hardware» more  SIGMETRICS 2008»
13 years 10 months ago
Network externalities and the deployment of security features and protocols in the internet
Getting new security features and protocols to be widely adopted and deployed in the Internet has been a continuing challenge. There are several reasons for this, in particular ec...
Marc Lelarge, Jean Bolot